./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI --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 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb --- 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-5e519f3 [2022-11-03 03:53:47,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:53:47,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:53:47,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:53:47,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:53:47,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:53:47,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:53:47,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:53:47,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:53:47,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:53:47,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:53:47,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:53:47,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:53:47,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:53:47,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:53:47,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:53:47,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:53:47,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:53:47,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:53:47,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:53:47,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:53:47,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:53:47,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:53:47,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:53:47,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:53:47,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:53:47,444 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:53:47,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:53:47,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:53:47,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:53:47,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:53:47,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:53:47,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:53:47,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:53:47,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:53:47,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:53:47,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:53:47,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:53:47,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:53:47,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:53:47,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:53:47,455 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:53:47,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:53:47,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:53:47,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:53:47,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:53:47,500 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:53:47,500 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:53:47,501 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:53:47,501 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:53:47,501 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:53:47,501 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:53:47,502 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:53:47,503 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:53:47,503 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:53:47,503 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:53:47,503 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:53:47,504 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:53:47,504 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:53:47,504 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:53:47,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:53:47,505 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:53:47,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:53:47,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:53:47,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:53:47,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:53:47,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:53:47,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:53:47,508 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:53:47,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:53:47,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:53:47,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:53:47,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:53:47,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:53:47,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:53:47,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:53:47,510 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:53:47,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:53:47,511 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:53:47,511 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:53:47,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:53:47,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:53:47,512 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:53:47,512 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_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/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_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI 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 -> 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb [2022-11-03 03:53:47,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:53:47,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:53:47,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:53:47,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:53:47,911 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:53:47,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 03:53:47,994 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/data/f60ebf4f3/b3ca84a13d62438c80e9e723daf7dd50/FLAG131061bba [2022-11-03 03:53:48,550 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:53:48,551 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 03:53:48,566 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/data/f60ebf4f3/b3ca84a13d62438c80e9e723daf7dd50/FLAG131061bba [2022-11-03 03:53:48,842 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/data/f60ebf4f3/b3ca84a13d62438c80e9e723daf7dd50 [2022-11-03 03:53:48,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:53:48,847 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:53:48,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:53:48,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:53:48,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:53:48,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:53:48" (1/1) ... [2022-11-03 03:53:48,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71653d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:48, skipping insertion in model container [2022-11-03 03:53:48,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:53:48" (1/1) ... [2022-11-03 03:53:48,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:53:48,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:53:49,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-03 03:53:49,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:53:49,511 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:53:49,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-03 03:53:49,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:53:49,638 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:53:49,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49 WrapperNode [2022-11-03 03:53:49,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:53:49,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:53:49,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:53:49,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:53:49,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,712 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2022-11-03 03:53:49,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:53:49,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:53:49,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:53:49,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:53:49,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,743 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:53:49,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:53:49,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:53:49,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:53:49,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (1/1) ... [2022-11-03 03:53:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:53:49,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:53:49,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:53:49,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:53:49,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:53:49,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:53:49,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:53:49,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:53:49,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:53:49,864 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-03 03:53:49,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-03 03:53:49,864 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-03 03:53:49,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-03 03:53:49,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:53:49,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:53:49,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:53:49,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:53:49,867 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 03:53:50,076 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:53:50,079 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:53:50,719 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:53:51,356 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:53:51,356 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 03:53:51,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:53:51 BoogieIcfgContainer [2022-11-03 03:53:51,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:53:51,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:53:51,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:53:51,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:53:51,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:53:48" (1/3) ... [2022-11-03 03:53:51,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151a6019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:53:51, skipping insertion in model container [2022-11-03 03:53:51,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:53:49" (2/3) ... [2022-11-03 03:53:51,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151a6019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:53:51, skipping insertion in model container [2022-11-03 03:53:51,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:53:51" (3/3) ... [2022-11-03 03:53:51,374 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i [2022-11-03 03:53:51,384 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:53:51,396 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:53:51,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 03:53:51,397 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:53:51,499 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-03 03:53:51,559 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:53:51,579 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 98 transitions, 206 flow [2022-11-03 03:53:51,582 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 98 transitions, 206 flow [2022-11-03 03:53:51,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-11-03 03:53:51,661 INFO L130 PetriNetUnfolder]: 2/96 cut-off events. [2022-11-03 03:53:51,662 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-03 03:53:51,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-11-03 03:53:51,669 INFO L118 LiptonReduction]: Number of co-enabled transitions 1310 [2022-11-03 03:53:57,734 INFO L133 LiptonReduction]: Checked pairs total: 3250 [2022-11-03 03:53:57,734 INFO L135 LiptonReduction]: Total number of compositions: 92 [2022-11-03 03:53:57,743 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2022-11-03 03:53:57,772 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 170 states, 167 states have (on average 2.6107784431137726) internal successors, (436), 169 states have internal predecessors, (436), 0 states have call successors, (0), 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-03 03:53:57,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:53:57,798 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;@1da72197, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:53:57,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-03 03:53:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 170 states, 167 states have (on average 2.6107784431137726) internal successors, (436), 169 states have internal predecessors, (436), 0 states have call successors, (0), 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-03 03:53:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 03:53:57,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:57,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 03:53:57,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:53:57,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash 977109, now seen corresponding path program 1 times [2022-11-03 03:53:57,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:57,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796155028] [2022-11-03 03:53:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:57,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:58,212 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-03 03:53:58,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:58,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796155028] [2022-11-03 03:53:58,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796155028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:58,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:58,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:53:58,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548038426] [2022-11-03 03:53:58,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:58,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:58,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:58,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:58,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:58,260 INFO L87 Difference]: Start difference. First operand has 170 states, 167 states have (on average 2.6107784431137726) internal successors, (436), 169 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:58,385 INFO L93 Difference]: Finished difference Result 138 states and 317 transitions. [2022-11-03 03:53:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:58,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-03 03:53:58,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:58,404 INFO L225 Difference]: With dead ends: 138 [2022-11-03 03:53:58,404 INFO L226 Difference]: Without dead ends: 132 [2022-11-03 03:53:58,405 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-03 03:53:58,410 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:58,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:53:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-03 03:53:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-03 03:53:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.33587786259542) internal successors, (306), 131 states have internal predecessors, (306), 0 states have call successors, (0), 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-03 03:53:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 306 transitions. [2022-11-03 03:53:58,488 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 306 transitions. Word has length 3 [2022-11-03 03:53:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:58,489 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 306 transitions. [2022-11-03 03:53:58,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:53:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 306 transitions. [2022-11-03 03:53:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 03:53:58,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:58,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:58,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:53:58,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:53:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash 509510277, now seen corresponding path program 1 times [2022-11-03 03:53:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:58,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083885775] [2022-11-03 03:53:58,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:58,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:58,761 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-03 03:53:58,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:58,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083885775] [2022-11-03 03:53:58,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083885775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:58,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:58,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 03:53:58,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422683045] [2022-11-03 03:53:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:58,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:53:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:58,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:53:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:53:58,765 INFO L87 Difference]: Start difference. First operand 132 states and 306 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-03 03:53:58,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:58,842 INFO L93 Difference]: Finished difference Result 187 states and 410 transitions. [2022-11-03 03:53:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:53:58,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-03 03:53:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:58,847 INFO L225 Difference]: With dead ends: 187 [2022-11-03 03:53:58,847 INFO L226 Difference]: Without dead ends: 160 [2022-11-03 03:53:58,848 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-03 03:53:58,850 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:58,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:53:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-03 03:53:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 145. [2022-11-03 03:53:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.2569444444444446) internal successors, (325), 144 states have internal predecessors, (325), 0 states have call successors, (0), 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-03 03:53:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 325 transitions. [2022-11-03 03:53:58,877 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 325 transitions. Word has length 7 [2022-11-03 03:53:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:58,878 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 325 transitions. [2022-11-03 03:53:58,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-03 03:53:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 325 transitions. [2022-11-03 03:53:58,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 03:53:58,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:58,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:58,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:53:58,880 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:53:58,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1385050365, now seen corresponding path program 1 times [2022-11-03 03:53:58,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:58,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020622973] [2022-11-03 03:53:58,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:59,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-03 03:53:59,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:59,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020622973] [2022-11-03 03:53:59,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020622973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:59,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:59,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:53:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635927542] [2022-11-03 03:53:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:59,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:53:59,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:59,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:53:59,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:53:59,178 INFO L87 Difference]: Start difference. First operand 145 states and 325 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-03 03:53:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:59,268 INFO L93 Difference]: Finished difference Result 152 states and 328 transitions. [2022-11-03 03:53:59,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:53:59,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-03 03:53:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:59,270 INFO L225 Difference]: With dead ends: 152 [2022-11-03 03:53:59,270 INFO L226 Difference]: Without dead ends: 152 [2022-11-03 03:53:59,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-03 03:53:59,274 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:59,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:53:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-03 03:53:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2022-11-03 03:53:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.230769230769231) internal successors, (290), 130 states have internal predecessors, (290), 0 states have call successors, (0), 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-03 03:53:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 290 transitions. [2022-11-03 03:53:59,294 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 290 transitions. Word has length 8 [2022-11-03 03:53:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:59,294 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 290 transitions. [2022-11-03 03:53:59,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-03 03:53:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 290 transitions. [2022-11-03 03:53:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 03:53:59,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:59,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:59,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:53:59,297 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:53:59,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:59,297 INFO L85 PathProgramCache]: Analyzing trace with hash 13109831, now seen corresponding path program 1 times [2022-11-03 03:53:59,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:59,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078238933] [2022-11-03 03:53:59,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:59,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:59,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:59,487 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-03 03:53:59,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:59,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078238933] [2022-11-03 03:53:59,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078238933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:59,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:59,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:53:59,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094145890] [2022-11-03 03:53:59,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:59,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:53:59,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:59,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:53:59,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:53:59,489 INFO L87 Difference]: Start difference. First operand 131 states and 290 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03 03:53:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:53:59,606 INFO L93 Difference]: Finished difference Result 108 states and 199 transitions. [2022-11-03 03:53:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:53:59,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03 03:53:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:53:59,608 INFO L225 Difference]: With dead ends: 108 [2022-11-03 03:53:59,608 INFO L226 Difference]: Without dead ends: 75 [2022-11-03 03:53:59,608 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-03 03:53:59,609 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:53:59,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:53:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-03 03:53:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-11-03 03:53:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.7027027027027026) internal successors, (126), 74 states have internal predecessors, (126), 0 states have call successors, (0), 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-03 03:53:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 126 transitions. [2022-11-03 03:53:59,614 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 126 transitions. Word has length 9 [2022-11-03 03:53:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:53:59,614 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 126 transitions. [2022-11-03 03:53:59,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-03 03:53:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 126 transitions. [2022-11-03 03:53:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 03:53:59,615 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:53:59,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:53:59,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:53:59,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:53:59,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:53:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1497259903, now seen corresponding path program 1 times [2022-11-03 03:53:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:53:59,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304479747] [2022-11-03 03:53:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:53:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:53:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:53:59,960 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-03 03:53:59,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:53:59,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304479747] [2022-11-03 03:53:59,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304479747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:53:59,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:53:59,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:53:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079937220] [2022-11-03 03:53:59,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:53:59,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:53:59,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:53:59,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:53:59,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:53:59,970 INFO L87 Difference]: Start difference. First operand 75 states and 126 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-03 03:54:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:00,096 INFO L93 Difference]: Finished difference Result 59 states and 93 transitions. [2022-11-03 03:54:00,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 03:54:00,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-03 03:54:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:00,097 INFO L225 Difference]: With dead ends: 59 [2022-11-03 03:54:00,097 INFO L226 Difference]: Without dead ends: 42 [2022-11-03 03:54:00,098 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-03 03:54:00,099 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:00,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:54:00,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-03 03:54:00,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-11-03 03:54:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 states have internal predecessors, (60), 0 states have call successors, (0), 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-03 03:54:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2022-11-03 03:54:00,102 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 12 [2022-11-03 03:54:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:00,102 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2022-11-03 03:54:00,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-03 03:54:00,103 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2022-11-03 03:54:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:54:00,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:00,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:00,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:54:00,104 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:54:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:00,105 INFO L85 PathProgramCache]: Analyzing trace with hash 718945967, now seen corresponding path program 1 times [2022-11-03 03:54:00,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:00,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999154275] [2022-11-03 03:54:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:00,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:54:00,832 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-03 03:54:00,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:54:00,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999154275] [2022-11-03 03:54:00,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999154275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:54:00,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:54:00,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:54:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032899646] [2022-11-03 03:54:00,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:54:00,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 03:54:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:54:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 03:54:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 03:54:00,835 INFO L87 Difference]: Start difference. First operand 39 states and 60 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-03 03:54:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:54:00,987 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2022-11-03 03:54:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:54:00,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-11-03 03:54:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:54:00,988 INFO L225 Difference]: With dead ends: 47 [2022-11-03 03:54:00,988 INFO L226 Difference]: Without dead ends: 29 [2022-11-03 03:54:00,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:54:00,989 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:54:00,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:54:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-03 03:54:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-03 03:54:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 0 states have call successors, (0), 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-03 03:54:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-11-03 03:54:00,992 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 16 [2022-11-03 03:54:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:54:00,992 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-11-03 03:54:00,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 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-03 03:54:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-11-03 03:54:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 03:54:00,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:54:00,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:54:00,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 03:54:00,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-03 03:54:00,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:54:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash -620907125, now seen corresponding path program 2 times [2022-11-03 03:54:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:54:00,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921449039] [2022-11-03 03:54:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:54:00,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:54:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:54:01,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 03:54:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 03:54:01,176 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 03:54:01,176 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 03:54:01,177 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-11-03 03:54:01,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-11-03 03:54:01,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-11-03 03:54:01,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-11-03 03:54:01,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-11-03 03:54:01,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 03:54:01,184 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-11-03 03:54:01,191 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 03:54:01,191 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 03:54:01,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:54:01 BasicIcfg [2022-11-03 03:54:01,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 03:54:01,305 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 03:54:01,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 03:54:01,305 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 03:54:01,306 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:53:51" (3/4) ... [2022-11-03 03:54:01,308 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 03:54:01,434 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 03:54:01,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 03:54:01,435 INFO L158 Benchmark]: Toolchain (without parser) took 12587.86ms. Allocated memory was 115.3MB in the beginning and 237.0MB in the end (delta: 121.6MB). Free memory was 77.3MB in the beginning and 166.1MB in the end (delta: -88.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2022-11-03 03:54:01,435 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 115.3MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 03:54:01,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 789.75ms. Allocated memory is still 115.3MB. Free memory was 77.1MB in the beginning and 78.3MB in the end (delta: -1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:54:01,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.71ms. Allocated memory is still 115.3MB. Free memory was 78.3MB in the beginning and 75.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 03:54:01,438 INFO L158 Benchmark]: Boogie Preprocessor took 35.93ms. Allocated memory is still 115.3MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 03:54:01,438 INFO L158 Benchmark]: RCFGBuilder took 1609.71ms. Allocated memory is still 115.3MB. Free memory was 73.5MB in the beginning and 71.3MB in the end (delta: 2.1MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2022-11-03 03:54:01,439 INFO L158 Benchmark]: TraceAbstraction took 9941.69ms. Allocated memory was 115.3MB in the beginning and 237.0MB in the end (delta: 121.6MB). Free memory was 70.6MB in the beginning and 175.6MB in the end (delta: -105.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2022-11-03 03:54:01,439 INFO L158 Benchmark]: Witness Printer took 129.37ms. Allocated memory is still 237.0MB. Free memory was 175.6MB in the beginning and 166.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 03:54:01,442 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.25ms. Allocated memory is still 115.3MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 789.75ms. Allocated memory is still 115.3MB. Free memory was 77.1MB in the beginning and 78.3MB in the end (delta: -1.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.71ms. Allocated memory is still 115.3MB. Free memory was 78.3MB in the beginning and 75.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.93ms. Allocated memory is still 115.3MB. Free memory was 75.6MB in the beginning and 73.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1609.71ms. Allocated memory is still 115.3MB. Free memory was 73.5MB in the beginning and 71.3MB in the end (delta: 2.1MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9941.69ms. Allocated memory was 115.3MB in the beginning and 237.0MB in the end (delta: 121.6MB). Free memory was 70.6MB in the beginning and 175.6MB in the end (delta: -105.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Witness Printer took 129.37ms. Allocated memory is still 237.0MB. Free memory was 175.6MB in the beginning and 166.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 103 PlacesBefore, 27 PlacesAfterwards, 98 TransitionsBefore, 21 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 3250 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1762, positive: 1634, positive conditional: 0, positive unconditional: 1634, negative: 128, negative conditional: 0, negative unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 973, positive: 929, positive conditional: 0, positive unconditional: 929, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 973, positive: 917, positive conditional: 0, positive unconditional: 917, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 56, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 626, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 601, negative conditional: 0, negative unconditional: 601, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1762, positive: 705, positive conditional: 0, positive unconditional: 705, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 973, unknown conditional: 0, unknown unconditional: 973] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L720] 0 int z = 0; [L721] 0 _Bool z$flush_delayed; [L722] 0 int z$mem_tmp; [L723] 0 _Bool z$r_buff0_thd0; [L724] 0 _Bool z$r_buff0_thd1; [L725] 0 _Bool z$r_buff0_thd2; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$read_delayed; [L730] 0 int *z$read_delayed_var; [L731] 0 int z$w_buff0; [L732] 0 _Bool z$w_buff0_used; [L733] 0 int z$w_buff1; [L734] 0 _Bool z$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L815] 0 pthread_t t1089; [L816] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1089, ((void *)0), P0, ((void *)0))=-1, t1089={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L740] 1 z$w_buff1 = z$w_buff0 [L741] 1 z$w_buff0 = 1 [L742] 1 z$w_buff1_used = z$w_buff0_used [L743] 1 z$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L745] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L746] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L747] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 pthread_t t1090; [L818] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1090, ((void *)0), P1, ((void *)0))=0, t1089={5:0}, t1090={3: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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L778] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L779] 2 z$flush_delayed = weak$$choice2 [L780] 2 z$mem_tmp = z [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L782] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L782] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L783] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L784] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L784] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L785] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L786] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L786] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L787] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L787] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] 2 __unbuffered_p1_EBX = z [L789] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L789] 2 z = z$flush_delayed ? z$mem_tmp : z [L790] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L793] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L793] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L793] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L793] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L794] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L794] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L795] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L795] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L796] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L796] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L797] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L797] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L824] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L824] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L824] 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) [L825] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L825] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L826] 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 [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L827] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L828] 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 [L831] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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: 816]: 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: 818]: 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 5 procedures, 118 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 18 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 39 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-03 03:54:01,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_817c0bea-6f03-4ada-a1d6-4f035ca0735b/bin/utaipan-7li7fVZpFI/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