./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS --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 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 06:40:04,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:40:04,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:40:04,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:40:04,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:40:04,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:40:04,648 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:40:04,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:40:04,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:40:04,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:40:04,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:40:04,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:40:04,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:40:04,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:40:04,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:40:04,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:40:04,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:40:04,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:40:04,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:40:04,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:40:04,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:40:04,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:40:04,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:40:04,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:40:04,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:40:04,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:40:04,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:40:04,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:40:04,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:40:04,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:40:04,679 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:40:04,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:40:04,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:40:04,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:40:04,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:40:04,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:40:04,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:40:04,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:40:04,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:40:04,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:40:04,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:40:04,689 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 06:40:04,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:40:04,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:40:04,718 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:40:04,719 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:40:04,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:40:04,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:40:04,720 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:40:04,720 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:40:04,721 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:40:04,721 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:40:04,722 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:40:04,722 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:40:04,722 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:40:04,723 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:40:04,723 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:40:04,723 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:40:04,723 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:40:04,724 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:40:04,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:40:04,725 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:40:04,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:40:04,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:40:04,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:40:04,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:40:04,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:40:04,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:40:04,728 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:40:04,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:40:04,728 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:40:04,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:40:04,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:40:04,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:40:04,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:40:04,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:40:04,730 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:40:04,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:40:04,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:40:04,730 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:40:04,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:40:04,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:40:04,732 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:40:04,732 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_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/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_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS 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 -> 0f6a99f321ab4c9a330ddab5bc184070524e662cb34c3dfc8d7fb0257fb493dd [2022-11-19 06:40:05,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:40:05,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:40:05,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:40:05,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:40:05,063 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:40:05,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-19 06:40:05,154 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/data/d57f21f8a/d65af3a1ee2d4955ac8d136496fdbd0a/FLAGf95b40ce9 [2022-11-19 06:40:05,773 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:40:05,774 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-19 06:40:05,804 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/data/d57f21f8a/d65af3a1ee2d4955ac8d136496fdbd0a/FLAGf95b40ce9 [2022-11-19 06:40:06,073 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/data/d57f21f8a/d65af3a1ee2d4955ac8d136496fdbd0a [2022-11-19 06:40:06,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:40:06,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:40:06,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:40:06,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:40:06,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:40:06,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435bd149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06, skipping insertion in model container [2022-11-19 06:40:06,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:40:06,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:40:06,366 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-19 06:40:06,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:40:06,667 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:40:06,680 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/sv-benchmarks/c/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-11-19 06:40:06,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:40:06,781 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:40:06,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06 WrapperNode [2022-11-19 06:40:06,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:40:06,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:40:06,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:40:06,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:40:06,791 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,844 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-19 06:40:06,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:40:06,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:40:06,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:40:06,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:40:06,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,900 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:40:06,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:40:06,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:40:06,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:40:06,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (1/1) ... [2022-11-19 06:40:06,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:40:06,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:40:06,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:40:06,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:40:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 06:40:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 06:40:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:40:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:40:06,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:40:06,999 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 06:40:06,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 06:40:06,999 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 06:40:06,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 06:40:06,999 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 06:40:06,999 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 06:40:06,999 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 06:40:07,000 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 06:40:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:40:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 06:40:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:40:07,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:40:07,002 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 06:40:07,145 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:40:07,147 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:40:07,468 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:40:07,694 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:40:07,694 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 06:40:07,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:40:07 BoogieIcfgContainer [2022-11-19 06:40:07,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:40:07,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:40:07,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:40:07,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:40:07,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:40:06" (1/3) ... [2022-11-19 06:40:07,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bf035f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:40:07, skipping insertion in model container [2022-11-19 06:40:07,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:40:06" (2/3) ... [2022-11-19 06:40:07,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66bf035f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:40:07, skipping insertion in model container [2022-11-19 06:40:07,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:40:07" (3/3) ... [2022-11-19 06:40:07,715 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2022-11-19 06:40:07,724 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-19 06:40:07,735 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:40:07,735 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 06:40:07,735 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 06:40:07,818 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 06:40:07,856 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 06:40:07,894 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 286 flow [2022-11-19 06:40:07,897 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 286 flow [2022-11-19 06:40:07,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-11-19 06:40:08,009 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-19 06:40:08,013 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 06:40:08,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-11-19 06:40:08,021 INFO L119 LiptonReduction]: Number of co-enabled transitions 2828 [2022-11-19 06:40:13,507 INFO L134 LiptonReduction]: Checked pairs total: 6790 [2022-11-19 06:40:13,507 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-11-19 06:40:13,520 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 31 transitions, 82 flow [2022-11-19 06:40:13,691 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1834 states, 1831 states have (on average 3.827416712179137) internal successors, (7008), 1833 states have internal predecessors, (7008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:13,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:40:13,724 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;@31650f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:40:13,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-19 06:40:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 1834 states, 1831 states have (on average 3.827416712179137) internal successors, (7008), 1833 states have internal predecessors, (7008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 06:40:13,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:40:13,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:40:13,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:40:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:40:13,753 INFO L85 PathProgramCache]: Analyzing trace with hash -202521230, now seen corresponding path program 1 times [2022-11-19 06:40:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:40:13,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958463762] [2022-11-19 06:40:13,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:40:13,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:40:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:40:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:40:14,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:40:14,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958463762] [2022-11-19 06:40:14,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958463762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:40:14,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:40:14,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:40:14,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394060248] [2022-11-19 06:40:14,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:40:14,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:40:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:40:14,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:40:14,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:40:14,414 INFO L87 Difference]: Start difference. First operand has 1834 states, 1831 states have (on average 3.827416712179137) internal successors, (7008), 1833 states have internal predecessors, (7008), 0 states have call successors, (0), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:40:14,567 INFO L93 Difference]: Finished difference Result 1514 states and 5584 transitions. [2022-11-19 06:40:14,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:40:14,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-19 06:40:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:40:14,609 INFO L225 Difference]: With dead ends: 1514 [2022-11-19 06:40:14,609 INFO L226 Difference]: Without dead ends: 1450 [2022-11-19 06:40:14,610 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-11-19 06:40:14,614 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:40:14,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 6 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:40:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2022-11-19 06:40:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2022-11-19 06:40:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1450 states, 1449 states have (on average 3.710144927536232) internal successors, (5376), 1449 states have internal predecessors, (5376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:14,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5376 transitions. [2022-11-19 06:40:14,817 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5376 transitions. Word has length 9 [2022-11-19 06:40:14,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:40:14,818 INFO L495 AbstractCegarLoop]: Abstraction has 1450 states and 5376 transitions. [2022-11-19 06:40:14,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:14,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5376 transitions. [2022-11-19 06:40:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 06:40:14,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:40:14,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:40:14,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:40:14,829 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:40:14,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:40:14,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1349307990, now seen corresponding path program 1 times [2022-11-19 06:40:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:40:14,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528067502] [2022-11-19 06:40:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:40:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:40:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:40:15,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:40:15,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:40:15,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528067502] [2022-11-19 06:40:15,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528067502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:40:15,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:40:15,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 06:40:15,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499603588] [2022-11-19 06:40:15,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:40:15,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:40:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:40:15,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:40:15,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:40:15,175 INFO L87 Difference]: Start difference. First operand 1450 states and 5376 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:40:15,306 INFO L93 Difference]: Finished difference Result 2110 states and 7474 transitions. [2022-11-19 06:40:15,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:40:15,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-19 06:40:15,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:40:15,332 INFO L225 Difference]: With dead ends: 2110 [2022-11-19 06:40:15,332 INFO L226 Difference]: Without dead ends: 2038 [2022-11-19 06:40:15,334 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-11-19 06:40:15,335 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:40:15,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:40:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2022-11-19 06:40:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1886. [2022-11-19 06:40:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1885 states have (on average 3.6148541114058355) internal successors, (6814), 1885 states have internal predecessors, (6814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 6814 transitions. [2022-11-19 06:40:15,470 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 6814 transitions. Word has length 11 [2022-11-19 06:40:15,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:40:15,471 INFO L495 AbstractCegarLoop]: Abstraction has 1886 states and 6814 transitions. [2022-11-19 06:40:15,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:15,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 6814 transitions. [2022-11-19 06:40:15,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 06:40:15,479 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:40:15,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:40:15,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 06:40:15,480 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:40:15,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:40:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1871795586, now seen corresponding path program 1 times [2022-11-19 06:40:15,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:40:15,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965345519] [2022-11-19 06:40:15,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:40:15,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:40:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:40:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:40:15,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:40:15,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965345519] [2022-11-19 06:40:15,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965345519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:40:15,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:40:15,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:40:15,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493400885] [2022-11-19 06:40:15,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:40:15,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:40:15,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:40:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:40:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:40:15,799 INFO L87 Difference]: Start difference. First operand 1886 states and 6814 transitions. Second operand has 4 states, 4 states have (on average 3.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-11-19 06:40:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:40:15,961 INFO L93 Difference]: Finished difference Result 1962 states and 6428 transitions. [2022-11-19 06:40:15,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 06:40:15,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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-11-19 06:40:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:40:15,973 INFO L225 Difference]: With dead ends: 1962 [2022-11-19 06:40:15,973 INFO L226 Difference]: Without dead ends: 1514 [2022-11-19 06:40:15,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-19 06:40:15,977 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:40:15,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 15 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:40:15,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-11-19 06:40:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-11-19 06:40:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1513 states have (on average 3.2769332452081956) internal successors, (4958), 1513 states have internal predecessors, (4958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 4958 transitions. [2022-11-19 06:40:16,060 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 4958 transitions. Word has length 12 [2022-11-19 06:40:16,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:40:16,060 INFO L495 AbstractCegarLoop]: Abstraction has 1514 states and 4958 transitions. [2022-11-19 06:40:16,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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-11-19 06:40:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 4958 transitions. [2022-11-19 06:40:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 06:40:16,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:40:16,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:40:16,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 06:40:16,064 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:40:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:40:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1693385463, now seen corresponding path program 1 times [2022-11-19 06:40:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:40:16,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477145845] [2022-11-19 06:40:16,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:40:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:40:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:40:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:40:16,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:40:16,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477145845] [2022-11-19 06:40:16,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477145845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:40:16,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:40:16,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 06:40:16,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372250928] [2022-11-19 06:40:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:40:16,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 06:40:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:40:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 06:40:16,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:40:16,335 INFO L87 Difference]: Start difference. First operand 1514 states and 4958 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-11-19 06:40:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:40:16,492 INFO L93 Difference]: Finished difference Result 1307 states and 3875 transitions. [2022-11-19 06:40:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:40:16,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-11-19 06:40:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:40:16,499 INFO L225 Difference]: With dead ends: 1307 [2022-11-19 06:40:16,499 INFO L226 Difference]: Without dead ends: 997 [2022-11-19 06:40:16,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:40:16,501 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 61 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:40:16,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 21 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:40:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2022-11-19 06:40:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 977. [2022-11-19 06:40:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 2.903688524590164) internal successors, (2834), 976 states have internal predecessors, (2834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:16,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2834 transitions. [2022-11-19 06:40:16,535 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2834 transitions. Word has length 14 [2022-11-19 06:40:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:40:16,536 INFO L495 AbstractCegarLoop]: Abstraction has 977 states and 2834 transitions. [2022-11-19 06:40:16,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-11-19 06:40:16,536 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2834 transitions. [2022-11-19 06:40:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:40:16,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:40:16,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:40:16,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 06:40:16,539 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:40:16,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:40:16,544 INFO L85 PathProgramCache]: Analyzing trace with hash 531760702, now seen corresponding path program 1 times [2022-11-19 06:40:16,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:40:16,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62260304] [2022-11-19 06:40:16,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:40:16,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:40:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:40:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:40:16,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:40:16,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62260304] [2022-11-19 06:40:16,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62260304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:40:16,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:40:16,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:40:16,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808508598] [2022-11-19 06:40:16,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:40:16,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:40:16,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:40:16,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:40:16,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:40:16,757 INFO L87 Difference]: Start difference. First operand 977 states and 2834 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-11-19 06:40:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:40:16,867 INFO L93 Difference]: Finished difference Result 1262 states and 3583 transitions. [2022-11-19 06:40:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:40:16,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-11-19 06:40:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:40:16,873 INFO L225 Difference]: With dead ends: 1262 [2022-11-19 06:40:16,873 INFO L226 Difference]: Without dead ends: 792 [2022-11-19 06:40:16,873 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-11-19 06:40:16,874 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:40:16,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 5 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:40:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2022-11-19 06:40:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 714. [2022-11-19 06:40:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 2.8092566619915846) internal successors, (2003), 713 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 2003 transitions. [2022-11-19 06:40:16,899 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 2003 transitions. Word has length 17 [2022-11-19 06:40:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:40:16,899 INFO L495 AbstractCegarLoop]: Abstraction has 714 states and 2003 transitions. [2022-11-19 06:40:16,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-11-19 06:40:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 2003 transitions. [2022-11-19 06:40:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 06:40:16,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:40:16,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:40:16,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 06:40:16,902 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:40:16,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:40:16,902 INFO L85 PathProgramCache]: Analyzing trace with hash 624957978, now seen corresponding path program 2 times [2022-11-19 06:40:16,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:40:16,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735306676] [2022-11-19 06:40:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:40:16,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:40:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:40:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:40:17,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:40:17,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735306676] [2022-11-19 06:40:17,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735306676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:40:17,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:40:17,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 06:40:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965858419] [2022-11-19 06:40:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:40:17,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 06:40:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:40:17,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 06:40:17,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 06:40:17,096 INFO L87 Difference]: Start difference. First operand 714 states and 2003 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-11-19 06:40:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:40:17,283 INFO L93 Difference]: Finished difference Result 608 states and 1667 transitions. [2022-11-19 06:40:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:40:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-11-19 06:40:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:40:17,287 INFO L225 Difference]: With dead ends: 608 [2022-11-19 06:40:17,288 INFO L226 Difference]: Without dead ends: 531 [2022-11-19 06:40:17,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:40:17,288 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 66 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 06:40:17,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 26 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 06:40:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-11-19 06:40:17,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2022-11-19 06:40:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 530 states have (on average 2.7830188679245285) internal successors, (1475), 530 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:17,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 1475 transitions. [2022-11-19 06:40:17,307 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 1475 transitions. Word has length 17 [2022-11-19 06:40:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:40:17,307 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 1475 transitions. [2022-11-19 06:40:17,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-11-19 06:40:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 1475 transitions. [2022-11-19 06:40:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:40:17,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:40:17,309 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] [2022-11-19 06:40:17,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 06:40:17,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:40:17,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:40:17,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1793451828, now seen corresponding path program 1 times [2022-11-19 06:40:17,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:40:17,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880132734] [2022-11-19 06:40:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:40:17,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:40:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:40:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:40:17,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:40:17,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880132734] [2022-11-19 06:40:17,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880132734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:40:17,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:40:17,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 06:40:17,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65896499] [2022-11-19 06:40:17,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:40:17,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:40:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:40:17,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:40:17,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 06:40:17,621 INFO L87 Difference]: Start difference. First operand 531 states and 1475 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:40:17,789 INFO L93 Difference]: Finished difference Result 507 states and 1426 transitions. [2022-11-19 06:40:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:40:17,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-11-19 06:40:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:40:17,792 INFO L225 Difference]: With dead ends: 507 [2022-11-19 06:40:17,792 INFO L226 Difference]: Without dead ends: 313 [2022-11-19 06:40:17,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-19 06:40:17,793 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 124 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:40:17,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 18 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:40:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-19 06:40:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-11-19 06:40:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 2.7211538461538463) internal successors, (849), 312 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 849 transitions. [2022-11-19 06:40:17,804 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 849 transitions. Word has length 20 [2022-11-19 06:40:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:40:17,804 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 849 transitions. [2022-11-19 06:40:17,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 849 transitions. [2022-11-19 06:40:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 06:40:17,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:40:17,806 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] [2022-11-19 06:40:17,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 06:40:17,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:40:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:40:17,807 INFO L85 PathProgramCache]: Analyzing trace with hash 183233476, now seen corresponding path program 1 times [2022-11-19 06:40:17,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:40:17,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616906073] [2022-11-19 06:40:17,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:40:17,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:40:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:40:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:40:18,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:40:18,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616906073] [2022-11-19 06:40:18,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616906073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:40:18,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:40:18,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:40:18,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967182724] [2022-11-19 06:40:18,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:40:18,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:40:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:40:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:40:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:40:18,086 INFO L87 Difference]: Start difference. First operand 313 states and 849 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:18,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:40:18,181 INFO L93 Difference]: Finished difference Result 423 states and 1136 transitions. [2022-11-19 06:40:18,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:40:18,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-19 06:40:18,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:40:18,182 INFO L225 Difference]: With dead ends: 423 [2022-11-19 06:40:18,183 INFO L226 Difference]: Without dead ends: 145 [2022-11-19 06:40:18,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-19 06:40:18,183 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:40:18,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:40:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-19 06:40:18,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-11-19 06:40:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.4375) internal successors, (351), 144 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 351 transitions. [2022-11-19 06:40:18,189 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 351 transitions. Word has length 24 [2022-11-19 06:40:18,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:40:18,189 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 351 transitions. [2022-11-19 06:40:18,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:18,189 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 351 transitions. [2022-11-19 06:40:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 06:40:18,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:40:18,190 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] [2022-11-19 06:40:18,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 06:40:18,190 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:40:18,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:40:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash 829436260, now seen corresponding path program 2 times [2022-11-19 06:40:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:40:18,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079658692] [2022-11-19 06:40:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:40:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:40:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:40:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 06:40:18,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:40:18,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079658692] [2022-11-19 06:40:18,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079658692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:40:18,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:40:18,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:40:18,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559026216] [2022-11-19 06:40:18,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:40:18,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 06:40:18,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:40:18,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 06:40:18,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 06:40:18,449 INFO L87 Difference]: Start difference. First operand 145 states and 351 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:40:18,538 INFO L93 Difference]: Finished difference Result 183 states and 437 transitions. [2022-11-19 06:40:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 06:40:18,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-19 06:40:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:40:18,539 INFO L225 Difference]: With dead ends: 183 [2022-11-19 06:40:18,540 INFO L226 Difference]: Without dead ends: 79 [2022-11-19 06:40:18,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-11-19 06:40:18,540 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 06:40:18,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 11 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 06:40:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-19 06:40:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-19 06:40:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 2.1153846153846154) internal successors, (165), 78 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 165 transitions. [2022-11-19 06:40:18,544 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 165 transitions. Word has length 24 [2022-11-19 06:40:18,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:40:18,544 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 165 transitions. [2022-11-19 06:40:18,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 06:40:18,545 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 165 transitions. [2022-11-19 06:40:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 06:40:18,545 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:40:18,545 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] [2022-11-19 06:40:18,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 06:40:18,546 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-19 06:40:18,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:40:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash -330988158, now seen corresponding path program 3 times [2022-11-19 06:40:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:40:18,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36267160] [2022-11-19 06:40:18,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:40:18,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:40:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:40:18,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 06:40:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 06:40:18,664 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 06:40:18,665 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 06:40:18,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-19 06:40:18,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-19 06:40:18,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-19 06:40:18,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-19 06:40:18,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-19 06:40:18,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-19 06:40:18,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-19 06:40:18,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 06:40:18,671 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-11-19 06:40:18,677 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 06:40:18,678 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:40:18,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:40:18 BasicIcfg [2022-11-19 06:40:18,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:40:18,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:40:18,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:40:18,750 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:40:18,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:40:07" (3/4) ... [2022-11-19 06:40:18,752 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-19 06:40:18,863 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:40:18,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:40:18,864 INFO L158 Benchmark]: Toolchain (without parser) took 12785.57ms. Allocated memory was 127.9MB in the beginning and 192.9MB in the end (delta: 65.0MB). Free memory was 92.1MB in the beginning and 90.1MB in the end (delta: 2.0MB). Peak memory consumption was 66.0MB. Max. memory is 16.1GB. [2022-11-19 06:40:18,864 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 36.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:40:18,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.05ms. Allocated memory is still 127.9MB. Free memory was 91.9MB in the beginning and 90.2MB in the end (delta: 1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 06:40:18,865 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.94ms. Allocated memory is still 127.9MB. Free memory was 90.2MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:40:18,866 INFO L158 Benchmark]: Boogie Preprocessor took 71.59ms. Allocated memory is still 127.9MB. Free memory was 88.0MB in the beginning and 86.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:40:18,866 INFO L158 Benchmark]: RCFGBuilder took 786.76ms. Allocated memory is still 127.9MB. Free memory was 86.0MB in the beginning and 54.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-19 06:40:18,867 INFO L158 Benchmark]: TraceAbstraction took 11042.48ms. Allocated memory was 127.9MB in the beginning and 192.9MB in the end (delta: 65.0MB). Free memory was 53.9MB in the beginning and 104.8MB in the end (delta: -50.9MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-11-19 06:40:18,868 INFO L158 Benchmark]: Witness Printer took 114.25ms. Allocated memory is still 192.9MB. Free memory was 104.8MB in the beginning and 90.1MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 06:40:18,870 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 36.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 702.05ms. Allocated memory is still 127.9MB. Free memory was 91.9MB in the beginning and 90.2MB in the end (delta: 1.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.94ms. Allocated memory is still 127.9MB. Free memory was 90.2MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.59ms. Allocated memory is still 127.9MB. Free memory was 88.0MB in the beginning and 86.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 786.76ms. Allocated memory is still 127.9MB. Free memory was 86.0MB in the beginning and 54.5MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11042.48ms. Allocated memory was 127.9MB in the beginning and 192.9MB in the end (delta: 65.0MB). Free memory was 53.9MB in the beginning and 104.8MB in the end (delta: -50.9MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Witness Printer took 114.25ms. Allocated memory is still 192.9MB. Free memory was 104.8MB in the beginning and 90.1MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 144 PlacesBefore, 43 PlacesAfterwards, 133 TransitionsBefore, 31 TransitionsAfterwards, 2828 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 6790 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4176, independent: 3995, independent conditional: 0, independent unconditional: 3995, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2139, independent: 2085, independent conditional: 0, independent unconditional: 2085, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2139, independent: 2058, independent conditional: 0, independent unconditional: 2058, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 377, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 310, dependent conditional: 0, dependent unconditional: 310, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4176, independent: 1910, independent conditional: 0, independent unconditional: 1910, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 2139, unknown conditional: 0, unknown unconditional: 2139] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 211, Positive conditional cache size: 0, Positive unconditional cache size: 211, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L738] 0 _Bool z$r_buff1_thd4; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L745] 0 _Bool weak$$choice0; [L743] 0 int z$w_buff1; [L746] 0 _Bool weak$$choice2; [L727] 0 _Bool z$flush_delayed; [L741] 0 int z$w_buff0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L712] 0 int __unbuffered_p1_EAX = 0; [L729] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd3; [L728] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd4; [L739] 0 _Bool z$read_delayed; [L718] 0 int a = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L740] 0 int *z$read_delayed_var; [L744] 0 _Bool z$w_buff1_used; [L710] 0 int __unbuffered_cnt = 0; [L720] 0 _Bool main$tmp_guard1; [L719] 0 _Bool main$tmp_guard0; [L742] 0 _Bool z$w_buff0_used; [L716] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L846] 0 pthread_t t1365; [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1365, ((void *)0), P0, ((void *)0))=-3, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1366; [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1366, ((void *)0), P1, ((void *)0))=-2, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1367; [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1367, ((void *)0), P2, ((void *)0))=-1, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1368; [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1368, ((void *)0), P3, ((void *)0))=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L780] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 847]: 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: 851]: 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: 849]: 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, 166 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 746 IncrementalHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 45 mSDtfsCounter, 746 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1886occurred in iteration=2, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 250 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 641 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-19 06:40:18,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2aa5522b-5859-432c-8783-debc3b2d13d5/bin/utaipan-I9t0OCRTmS/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