./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0 --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 a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 --- 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-e04fb08 [2022-11-16 20:06:00,236 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:06:00,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:06:00,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:06:00,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:06:00,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:06:00,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:06:00,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:06:00,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:06:00,308 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:06:00,309 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:06:00,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:06:00,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:06:00,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:06:00,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:06:00,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:06:00,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:06:00,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:06:00,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:06:00,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:06:00,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:06:00,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:06:00,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:06:00,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:06:00,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:06:00,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:06:00,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:06:00,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:06:00,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:06:00,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:06:00,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:06:00,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:06:00,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:06:00,343 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:06:00,344 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:06:00,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:06:00,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:06:00,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:06:00,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:06:00,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:06:00,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:06:00,350 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 20:06:00,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:06:00,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:06:00,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:06:00,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:06:00,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:06:00,389 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:06:00,389 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:06:00,389 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:06:00,389 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:06:00,390 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 20:06:00,391 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:06:00,391 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:06:00,391 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 20:06:00,391 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 20:06:00,392 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:06:00,392 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 20:06:00,392 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 20:06:00,392 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 20:06:00,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:06:00,393 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 20:06:00,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:06:00,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 20:06:00,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:06:00,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 20:06:00,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:06:00,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 20:06:00,396 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 20:06:00,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 20:06:00,396 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:06:00,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 20:06:00,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:06:00,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:06:00,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:06:00,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:06:00,398 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 20:06:00,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:06:00,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 20:06:00,399 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 20:06:00,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 20:06:00,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 20:06:00,399 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:06:00,400 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_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/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_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0 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 -> a4ebc4444460a05c0fe2d26c6269a3bce4de01cd65e247714c5237856dd0f827 [2022-11-16 20:06:00,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:06:00,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:06:00,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:06:00,726 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:06:00,727 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:06:00,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/pthread-wmm/mix055.opt.i [2022-11-16 20:06:00,801 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/data/310664892/d225ed6d59374672a1b44aaf52d0d735/FLAG7ef3aef32 [2022-11-16 20:06:01,348 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:06:01,349 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/sv-benchmarks/c/pthread-wmm/mix055.opt.i [2022-11-16 20:06:01,363 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/data/310664892/d225ed6d59374672a1b44aaf52d0d735/FLAG7ef3aef32 [2022-11-16 20:06:01,655 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/data/310664892/d225ed6d59374672a1b44aaf52d0d735 [2022-11-16 20:06:01,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:06:01,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:06:01,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:06:01,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:06:01,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:06:01,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:06:01" (1/1) ... [2022-11-16 20:06:01,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a049a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:01, skipping insertion in model container [2022-11-16 20:06:01,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:06:01" (1/1) ... [2022-11-16 20:06:01,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:06:01,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:06:01,978 WARN L229 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_084d3bdb-7c28-4872-91db-47ac67e10fdd/sv-benchmarks/c/pthread-wmm/mix055.opt.i[944,957] [2022-11-16 20:06:02,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:06:02,191 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:06:02,209 WARN L229 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_084d3bdb-7c28-4872-91db-47ac67e10fdd/sv-benchmarks/c/pthread-wmm/mix055.opt.i[944,957] [2022-11-16 20:06:02,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:06:02,327 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:06:02,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02 WrapperNode [2022-11-16 20:06:02,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:06:02,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:06:02,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:06:02,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:06:02,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,380 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-11-16 20:06:02,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:06:02,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:06:02,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:06:02,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:06:02,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,407 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:06:02,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:06:02,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:06:02,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:06:02,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (1/1) ... [2022-11-16 20:06:02,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:06:02,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:06:02,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:06:02,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:06:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 20:06:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 20:06:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:06:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 20:06:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 20:06:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 20:06:02,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 20:06:02,504 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 20:06:02,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 20:06:02,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 20:06:02,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 20:06:02,504 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 20:06:02,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 20:06:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 20:06:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 20:06:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:06:02,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:06:02,508 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 20:06:02,733 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:06:02,735 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:06:03,075 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:06:03,228 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:06:03,228 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 20:06:03,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:06:03 BoogieIcfgContainer [2022-11-16 20:06:03,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:06:03,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:06:03,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:06:03,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:06:03,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:06:01" (1/3) ... [2022-11-16 20:06:03,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19709403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:06:03, skipping insertion in model container [2022-11-16 20:06:03,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:02" (2/3) ... [2022-11-16 20:06:03,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19709403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:06:03, skipping insertion in model container [2022-11-16 20:06:03,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:06:03" (3/3) ... [2022-11-16 20:06:03,238 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055.opt.i [2022-11-16 20:06:03,246 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 20:06:03,256 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:06:03,256 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 20:06:03,279 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 20:06:03,379 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 20:06:03,437 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 20:06:03,457 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 133 transitions, 286 flow [2022-11-16 20:06:03,462 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 133 transitions, 286 flow [2022-11-16 20:06:03,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-11-16 20:06:03,538 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-11-16 20:06:03,538 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 20:06:03,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-11-16 20:06:03,546 INFO L119 LiptonReduction]: Number of co-enabled transitions 2952 [2022-11-16 20:06:10,522 INFO L134 LiptonReduction]: Checked pairs total: 7430 [2022-11-16 20:06:10,523 INFO L136 LiptonReduction]: Total number of compositions: 115 [2022-11-16 20:06:10,531 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 32 transitions, 84 flow [2022-11-16 20:06:10,699 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2282 states, 2279 states have (on average 3.8824045634050024) internal successors, (8848), 2281 states have internal predecessors, (8848), 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-16 20:06:10,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:06:10,731 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;@1823b3b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:06:10,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-16 20:06:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 2282 states, 2279 states have (on average 3.8824045634050024) internal successors, (8848), 2281 states have internal predecessors, (8848), 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-16 20:06:10,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 20:06:10,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:10,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:10,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:10,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1570996793, now seen corresponding path program 1 times [2022-11-16 20:06:10,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:10,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180965727] [2022-11-16 20:06:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:11,313 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-16 20:06:11,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:11,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180965727] [2022-11-16 20:06:11,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180965727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:11,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:11,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 20:06:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263222171] [2022-11-16 20:06:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:11,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:06:11,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:11,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:06:11,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:06:11,352 INFO L87 Difference]: Start difference. First operand has 2282 states, 2279 states have (on average 3.8824045634050024) internal successors, (8848), 2281 states have internal predecessors, (8848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:11,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:11,476 INFO L93 Difference]: Finished difference Result 1882 states and 7048 transitions. [2022-11-16 20:06:11,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:06:11,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 20:06:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:11,505 INFO L225 Difference]: With dead ends: 1882 [2022-11-16 20:06:11,506 INFO L226 Difference]: Without dead ends: 1802 [2022-11-16 20:06:11,507 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-16 20:06:11,509 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:11,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:06:11,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2022-11-16 20:06:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2022-11-16 20:06:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1801 states have (on average 3.7667962243198225) internal successors, (6784), 1801 states have internal predecessors, (6784), 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-16 20:06:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2022-11-16 20:06:11,644 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2022-11-16 20:06:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:11,645 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2022-11-16 20:06:11,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:11,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2022-11-16 20:06:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 20:06:11,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:11,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:11,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 20:06:11,655 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2100628343, now seen corresponding path program 1 times [2022-11-16 20:06:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:11,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31207552] [2022-11-16 20:06:11,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:12,704 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-16 20:06:12,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:12,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31207552] [2022-11-16 20:06:12,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31207552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:12,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:12,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:06:12,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373927009] [2022-11-16 20:06:12,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:12,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:06:12,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:12,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:06:12,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:06:12,708 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:12,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:12,967 INFO L93 Difference]: Finished difference Result 2570 states and 9253 transitions. [2022-11-16 20:06:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:06:12,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 20:06:12,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:12,996 INFO L225 Difference]: With dead ends: 2570 [2022-11-16 20:06:12,996 INFO L226 Difference]: Without dead ends: 2554 [2022-11-16 20:06:12,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:06:13,000 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:13,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:06:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-11-16 20:06:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 1936. [2022-11-16 20:06:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1935 states have (on average 3.660981912144703) internal successors, (7084), 1935 states have internal predecessors, (7084), 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-16 20:06:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 7084 transitions. [2022-11-16 20:06:13,104 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 7084 transitions. Word has length 11 [2022-11-16 20:06:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:13,105 INFO L495 AbstractCegarLoop]: Abstraction has 1936 states and 7084 transitions. [2022-11-16 20:06:13,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 7084 transitions. [2022-11-16 20:06:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 20:06:13,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:13,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:13,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 20:06:13,111 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:13,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1248740285, now seen corresponding path program 1 times [2022-11-16 20:06:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:13,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168663617] [2022-11-16 20:06:13,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:13,745 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-16 20:06:13,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:13,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168663617] [2022-11-16 20:06:13,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168663617] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:13,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:13,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:06:13,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022776794] [2022-11-16 20:06:13,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:13,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:06:13,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:13,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:06:13,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:06:13,748 INFO L87 Difference]: Start difference. First operand 1936 states and 7084 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:13,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:13,843 INFO L93 Difference]: Finished difference Result 1866 states and 6788 transitions. [2022-11-16 20:06:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:06:13,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 20:06:13,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:13,858 INFO L225 Difference]: With dead ends: 1866 [2022-11-16 20:06:13,859 INFO L226 Difference]: Without dead ends: 1866 [2022-11-16 20:06:13,860 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-16 20:06:13,863 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:13,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:06:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-11-16 20:06:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1826. [2022-11-16 20:06:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1825 states have (on average 3.6526027397260274) internal successors, (6666), 1825 states have internal predecessors, (6666), 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-16 20:06:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 6666 transitions. [2022-11-16 20:06:13,945 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 6666 transitions. Word has length 12 [2022-11-16 20:06:13,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:13,948 INFO L495 AbstractCegarLoop]: Abstraction has 1826 states and 6666 transitions. [2022-11-16 20:06:13,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:13,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 6666 transitions. [2022-11-16 20:06:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 20:06:13,950 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:13,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:13,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 20:06:13,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash 54957731, now seen corresponding path program 1 times [2022-11-16 20:06:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:13,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447555395] [2022-11-16 20:06:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:14,726 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-16 20:06:14,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:14,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447555395] [2022-11-16 20:06:14,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447555395] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:14,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:14,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:06:14,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400432112] [2022-11-16 20:06:14,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:14,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:06:14,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:14,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:06:14,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:06:14,729 INFO L87 Difference]: Start difference. First operand 1826 states and 6666 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 20:06:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:14,902 INFO L93 Difference]: Finished difference Result 2034 states and 7446 transitions. [2022-11-16 20:06:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:06:14,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-11-16 20:06:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:14,918 INFO L225 Difference]: With dead ends: 2034 [2022-11-16 20:06:14,918 INFO L226 Difference]: Without dead ends: 2034 [2022-11-16 20:06:14,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:06:14,919 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:14,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 18 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:06:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2022-11-16 20:06:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1974. [2022-11-16 20:06:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 3.676634566649772) internal successors, (7254), 1973 states have internal predecessors, (7254), 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-16 20:06:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 7254 transitions. [2022-11-16 20:06:15,010 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 7254 transitions. Word has length 13 [2022-11-16 20:06:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:15,010 INFO L495 AbstractCegarLoop]: Abstraction has 1974 states and 7254 transitions. [2022-11-16 20:06:15,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 20:06:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 7254 transitions. [2022-11-16 20:06:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 20:06:15,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:15,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:15,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 20:06:15,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:15,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash 56242061, now seen corresponding path program 2 times [2022-11-16 20:06:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:15,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860697831] [2022-11-16 20:06:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:15,682 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-16 20:06:15,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:15,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860697831] [2022-11-16 20:06:15,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860697831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:15,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:15,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:06:15,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000709296] [2022-11-16 20:06:15,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:15,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:06:15,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:15,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:06:15,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:06:15,685 INFO L87 Difference]: Start difference. First operand 1974 states and 7254 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 20:06:15,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:15,831 INFO L93 Difference]: Finished difference Result 2114 states and 7674 transitions. [2022-11-16 20:06:15,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:06:15,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-11-16 20:06:15,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:15,846 INFO L225 Difference]: With dead ends: 2114 [2022-11-16 20:06:15,846 INFO L226 Difference]: Without dead ends: 2114 [2022-11-16 20:06:15,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:06:15,847 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 49 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:15,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 10 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:06:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2022-11-16 20:06:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1878. [2022-11-16 20:06:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1877 states have (on average 3.6345231752797016) internal successors, (6822), 1877 states have internal predecessors, (6822), 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-16 20:06:15,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 6822 transitions. [2022-11-16 20:06:15,947 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 6822 transitions. Word has length 13 [2022-11-16 20:06:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:15,947 INFO L495 AbstractCegarLoop]: Abstraction has 1878 states and 6822 transitions. [2022-11-16 20:06:15,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-16 20:06:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 6822 transitions. [2022-11-16 20:06:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 20:06:15,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:15,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:15,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 20:06:15,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:15,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:15,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1176468930, now seen corresponding path program 1 times [2022-11-16 20:06:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:15,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831875901] [2022-11-16 20:06:15,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:15,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:16,132 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-16 20:06:16,133 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:16,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831875901] [2022-11-16 20:06:16,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831875901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:16,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:16,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:06:16,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856575343] [2022-11-16 20:06:16,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:16,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:06:16,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:16,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:06:16,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 20:06:16,136 INFO L87 Difference]: Start difference. First operand 1878 states and 6822 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-16 20:06:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:16,265 INFO L93 Difference]: Finished difference Result 1944 states and 6475 transitions. [2022-11-16 20:06:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 20:06:16,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-16 20:06:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:16,275 INFO L225 Difference]: With dead ends: 1944 [2022-11-16 20:06:16,275 INFO L226 Difference]: Without dead ends: 1480 [2022-11-16 20:06:16,276 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-16 20:06:16,276 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:16,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 20 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:06:16,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2022-11-16 20:06:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2022-11-16 20:06:16,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1479 states have (on average 3.3002028397565923) internal successors, (4881), 1479 states have internal predecessors, (4881), 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-16 20:06:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 4881 transitions. [2022-11-16 20:06:16,325 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 4881 transitions. Word has length 15 [2022-11-16 20:06:16,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:16,326 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 4881 transitions. [2022-11-16 20:06:16,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-16 20:06:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 4881 transitions. [2022-11-16 20:06:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 20:06:16,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:16,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:16,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 20:06:16,329 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:16,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2110406752, now seen corresponding path program 1 times [2022-11-16 20:06:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:16,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808573390] [2022-11-16 20:06:16,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:16,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:06:16,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:16,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808573390] [2022-11-16 20:06:16,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808573390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:16,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:16,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:06:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835984413] [2022-11-16 20:06:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:16,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:06:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:16,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:06:16,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:06:16,545 INFO L87 Difference]: Start difference. First operand 1480 states and 4881 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-16 20:06:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:16,699 INFO L93 Difference]: Finished difference Result 1257 states and 3832 transitions. [2022-11-16 20:06:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:06:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-16 20:06:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:16,705 INFO L225 Difference]: With dead ends: 1257 [2022-11-16 20:06:16,705 INFO L226 Difference]: Without dead ends: 955 [2022-11-16 20:06:16,706 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-16 20:06:16,707 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 68 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:16,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 28 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:06:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-11-16 20:06:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2022-11-16 20:06:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 2.9874213836477987) internal successors, (2850), 954 states have internal predecessors, (2850), 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-16 20:06:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 2850 transitions. [2022-11-16 20:06:16,735 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 2850 transitions. Word has length 16 [2022-11-16 20:06:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:16,736 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 2850 transitions. [2022-11-16 20:06:16,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-16 20:06:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 2850 transitions. [2022-11-16 20:06:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 20:06:16,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:16,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:16,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 20:06:16,739 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:16,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2050408654, now seen corresponding path program 1 times [2022-11-16 20:06:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:16,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704944830] [2022-11-16 20:06:16,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:16,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:16,893 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-16 20:06:16,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:16,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704944830] [2022-11-16 20:06:16,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704944830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:16,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:16,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 20:06:16,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188405661] [2022-11-16 20:06:16,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:16,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:06:16,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:16,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:06:16,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:06:16,896 INFO L87 Difference]: Start difference. First operand 955 states and 2850 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-16 20:06:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:16,981 INFO L93 Difference]: Finished difference Result 1340 states and 3889 transitions. [2022-11-16 20:06:16,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:06:16,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-11-16 20:06:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:16,987 INFO L225 Difference]: With dead ends: 1340 [2022-11-16 20:06:16,988 INFO L226 Difference]: Without dead ends: 956 [2022-11-16 20:06:16,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:06:16,989 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:16,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:06:16,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2022-11-16 20:06:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 934. [2022-11-16 20:06:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 933 states have (on average 2.852090032154341) internal successors, (2661), 933 states have internal predecessors, (2661), 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-16 20:06:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2661 transitions. [2022-11-16 20:06:17,017 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2661 transitions. Word has length 18 [2022-11-16 20:06:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:17,018 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 2661 transitions. [2022-11-16 20:06:17,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-16 20:06:17,018 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2661 transitions. [2022-11-16 20:06:17,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 20:06:17,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:17,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:17,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 20:06:17,021 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1896429119, now seen corresponding path program 1 times [2022-11-16 20:06:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:17,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892673969] [2022-11-16 20:06:17,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:17,265 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-16 20:06:17,265 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:17,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892673969] [2022-11-16 20:06:17,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892673969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:17,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:17,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 20:06:17,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795398314] [2022-11-16 20:06:17,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:17,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 20:06:17,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:17,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 20:06:17,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-16 20:06:17,268 INFO L87 Difference]: Start difference. First operand 934 states and 2661 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-16 20:06:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:17,440 INFO L93 Difference]: Finished difference Result 817 states and 2286 transitions. [2022-11-16 20:06:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 20:06:17,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-11-16 20:06:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:17,444 INFO L225 Difference]: With dead ends: 817 [2022-11-16 20:06:17,444 INFO L226 Difference]: Without dead ends: 713 [2022-11-16 20:06:17,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:06:17,445 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 86 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:17,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 31 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:06:17,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-16 20:06:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 689. [2022-11-16 20:06:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 2.8459302325581395) internal successors, (1958), 688 states have internal predecessors, (1958), 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-16 20:06:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1958 transitions. [2022-11-16 20:06:17,467 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1958 transitions. Word has length 18 [2022-11-16 20:06:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:17,467 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1958 transitions. [2022-11-16 20:06:17,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-16 20:06:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1958 transitions. [2022-11-16 20:06:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 20:06:17,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:17,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:17,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 20:06:17,470 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1276677801, now seen corresponding path program 1 times [2022-11-16 20:06:17,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:17,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079280314] [2022-11-16 20:06:17,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:17,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:18,155 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-16 20:06:18,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:18,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079280314] [2022-11-16 20:06:18,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079280314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:18,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:18,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:06:18,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256637659] [2022-11-16 20:06:18,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:18,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:06:18,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:18,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:06:18,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:06:18,157 INFO L87 Difference]: Start difference. First operand 689 states and 1958 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:18,487 INFO L93 Difference]: Finished difference Result 969 states and 2686 transitions. [2022-11-16 20:06:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:06:18,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 20:06:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:18,491 INFO L225 Difference]: With dead ends: 969 [2022-11-16 20:06:18,491 INFO L226 Difference]: Without dead ends: 587 [2022-11-16 20:06:18,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:06:18,491 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:18,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 16 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:06:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-11-16 20:06:18,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 547. [2022-11-16 20:06:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 2.608058608058608) internal successors, (1424), 546 states have internal predecessors, (1424), 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-16 20:06:18,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1424 transitions. [2022-11-16 20:06:18,511 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1424 transitions. Word has length 21 [2022-11-16 20:06:18,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:18,511 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 1424 transitions. [2022-11-16 20:06:18,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1424 transitions. [2022-11-16 20:06:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 20:06:18,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:18,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:18,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 20:06:18,514 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:18,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2106438271, now seen corresponding path program 2 times [2022-11-16 20:06:18,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:18,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884704957] [2022-11-16 20:06:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:18,731 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-16 20:06:18,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:18,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884704957] [2022-11-16 20:06:18,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884704957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:18,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:18,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 20:06:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868793821] [2022-11-16 20:06:18,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:18,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 20:06:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:18,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 20:06:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:06:18,734 INFO L87 Difference]: Start difference. First operand 547 states and 1424 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:18,897 INFO L93 Difference]: Finished difference Result 522 states and 1374 transitions. [2022-11-16 20:06:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 20:06:18,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 20:06:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:18,899 INFO L225 Difference]: With dead ends: 522 [2022-11-16 20:06:18,899 INFO L226 Difference]: Without dead ends: 201 [2022-11-16 20:06:18,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:06:18,900 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 70 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:18,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 24 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:06:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-16 20:06:18,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 179. [2022-11-16 20:06:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 2.5) internal successors, (445), 178 states have internal predecessors, (445), 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-16 20:06:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 445 transitions. [2022-11-16 20:06:18,914 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 445 transitions. Word has length 21 [2022-11-16 20:06:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:18,915 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 445 transitions. [2022-11-16 20:06:18,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 445 transitions. [2022-11-16 20:06:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 20:06:18,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:18,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:18,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 20:06:18,916 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:18,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1762663558, now seen corresponding path program 1 times [2022-11-16 20:06:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:18,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984608106] [2022-11-16 20:06:18,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:20,557 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-16 20:06:20,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:20,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984608106] [2022-11-16 20:06:20,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984608106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:20,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:20,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 20:06:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842397389] [2022-11-16 20:06:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:20,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 20:06:20,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:20,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 20:06:20,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-16 20:06:20,560 INFO L87 Difference]: Start difference. First operand 179 states and 445 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:21,077 INFO L93 Difference]: Finished difference Result 432 states and 1053 transitions. [2022-11-16 20:06:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 20:06:21,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-16 20:06:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:21,080 INFO L225 Difference]: With dead ends: 432 [2022-11-16 20:06:21,080 INFO L226 Difference]: Without dead ends: 250 [2022-11-16 20:06:21,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-16 20:06:21,080 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:21,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 20:06:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-16 20:06:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 211. [2022-11-16 20:06:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.4285714285714284) internal successors, (510), 210 states have internal predecessors, (510), 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-16 20:06:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 510 transitions. [2022-11-16 20:06:21,087 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 510 transitions. Word has length 25 [2022-11-16 20:06:21,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:21,088 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 510 transitions. [2022-11-16 20:06:21,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 510 transitions. [2022-11-16 20:06:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 20:06:21,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:21,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:21,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 20:06:21,089 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:21,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash -620820504, now seen corresponding path program 2 times [2022-11-16 20:06:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:21,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560703040] [2022-11-16 20:06:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:21,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:21,837 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-16 20:06:21,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:21,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560703040] [2022-11-16 20:06:21,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560703040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:21,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:21,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 20:06:21,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165927989] [2022-11-16 20:06:21,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:21,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 20:06:21,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:21,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 20:06:21,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:06:21,839 INFO L87 Difference]: Start difference. First operand 211 states and 510 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:22,084 INFO L93 Difference]: Finished difference Result 289 states and 704 transitions. [2022-11-16 20:06:22,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:06:22,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-16 20:06:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:22,085 INFO L225 Difference]: With dead ends: 289 [2022-11-16 20:06:22,085 INFO L226 Difference]: Without dead ends: 95 [2022-11-16 20:06:22,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 20:06:22,086 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:22,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 12 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 20:06:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-16 20:06:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2022-11-16 20:06:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.188888888888889) internal successors, (197), 90 states have internal predecessors, (197), 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-16 20:06:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 197 transitions. [2022-11-16 20:06:22,089 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 197 transitions. Word has length 25 [2022-11-16 20:06:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:22,089 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 197 transitions. [2022-11-16 20:06:22,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 197 transitions. [2022-11-16 20:06:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 20:06:22,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:22,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:22,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 20:06:22,090 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:22,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:22,092 INFO L85 PathProgramCache]: Analyzing trace with hash 602512744, now seen corresponding path program 3 times [2022-11-16 20:06:22,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:22,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701793727] [2022-11-16 20:06:22,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:22,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:06:23,247 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-16 20:06:23,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:06:23,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701793727] [2022-11-16 20:06:23,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701793727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:06:23,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:06:23,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 20:06:23,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549337728] [2022-11-16 20:06:23,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:06:23,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 20:06:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:06:23,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 20:06:23,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-16 20:06:23,250 INFO L87 Difference]: Start difference. First operand 91 states and 197 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:23,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:06:23,424 INFO L93 Difference]: Finished difference Result 136 states and 286 transitions. [2022-11-16 20:06:23,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 20:06:23,425 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-16 20:06:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:06:23,426 INFO L225 Difference]: With dead ends: 136 [2022-11-16 20:06:23,426 INFO L226 Difference]: Without dead ends: 82 [2022-11-16 20:06:23,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 20:06:23,427 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 28 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:06:23,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 31 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 20:06:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-16 20:06:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2022-11-16 20:06:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.9516129032258065) internal successors, (121), 62 states have internal predecessors, (121), 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-16 20:06:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 121 transitions. [2022-11-16 20:06:23,429 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 121 transitions. Word has length 25 [2022-11-16 20:06:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:06:23,429 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 121 transitions. [2022-11-16 20:06:23,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 20:06:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 121 transitions. [2022-11-16 20:06:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 20:06:23,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:06:23,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:23,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 20:06:23,431 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-16 20:06:23,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:06:23,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1981835992, now seen corresponding path program 4 times [2022-11-16 20:06:23,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:06:23,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973892228] [2022-11-16 20:06:23,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:06:23,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:06:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:06:23,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 20:06:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 20:06:23,539 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-16 20:06:23,539 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 20:06:23,540 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-16 20:06:23,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-16 20:06:23,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-16 20:06:23,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-16 20:06:23,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-16 20:06:23,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-16 20:06:23,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-16 20:06:23,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 20:06:23,546 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:06:23,551 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 20:06:23,552 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 20:06:23,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 08:06:23 BasicIcfg [2022-11-16 20:06:23,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 20:06:23,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 20:06:23,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 20:06:23,650 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 20:06:23,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:06:03" (3/4) ... [2022-11-16 20:06:23,652 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 20:06:23,734 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/witness.graphml [2022-11-16 20:06:23,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 20:06:23,738 INFO L158 Benchmark]: Toolchain (without parser) took 22078.99ms. Allocated memory was 132.1MB in the beginning and 375.4MB in the end (delta: 243.3MB). Free memory was 94.6MB in the beginning and 173.0MB in the end (delta: -78.4MB). Peak memory consumption was 165.1MB. Max. memory is 16.1GB. [2022-11-16 20:06:23,738 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 132.1MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 20:06:23,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 666.48ms. Allocated memory is still 132.1MB. Free memory was 94.4MB in the beginning and 95.3MB in the end (delta: -887.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 20:06:23,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.15ms. Allocated memory is still 132.1MB. Free memory was 95.2MB in the beginning and 92.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:06:23,740 INFO L158 Benchmark]: Boogie Preprocessor took 30.95ms. Allocated memory is still 132.1MB. Free memory was 92.4MB in the beginning and 90.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 20:06:23,741 INFO L158 Benchmark]: RCFGBuilder took 817.55ms. Allocated memory is still 132.1MB. Free memory was 90.5MB in the beginning and 56.6MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-16 20:06:23,741 INFO L158 Benchmark]: TraceAbstraction took 20416.78ms. Allocated memory was 132.1MB in the beginning and 375.4MB in the end (delta: 243.3MB). Free memory was 55.9MB in the beginning and 187.7MB in the end (delta: -131.7MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2022-11-16 20:06:23,742 INFO L158 Benchmark]: Witness Printer took 88.07ms. Allocated memory is still 375.4MB. Free memory was 187.7MB in the beginning and 173.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 20:06:23,744 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.24ms. Allocated memory is still 132.1MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 666.48ms. Allocated memory is still 132.1MB. Free memory was 94.4MB in the beginning and 95.3MB in the end (delta: -887.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.15ms. Allocated memory is still 132.1MB. Free memory was 95.2MB in the beginning and 92.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.95ms. Allocated memory is still 132.1MB. Free memory was 92.4MB in the beginning and 90.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 817.55ms. Allocated memory is still 132.1MB. Free memory was 90.5MB in the beginning and 56.6MB in the end (delta: 33.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 20416.78ms. Allocated memory was 132.1MB in the beginning and 375.4MB in the end (delta: 243.3MB). Free memory was 55.9MB in the beginning and 187.7MB in the end (delta: -131.7MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. * Witness Printer took 88.07ms. Allocated memory is still 375.4MB. Free memory was 187.7MB in the beginning and 173.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 144 PlacesBefore, 44 PlacesAfterwards, 133 TransitionsBefore, 32 TransitionsAfterwards, 2952 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 7430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3932, independent: 3733, independent conditional: 0, independent unconditional: 3733, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2205, independent: 2126, independent conditional: 0, independent unconditional: 2126, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2205, independent: 2086, independent conditional: 0, independent unconditional: 2086, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 119, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 808, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 737, dependent conditional: 0, dependent unconditional: 737, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3932, independent: 1607, independent conditional: 0, independent unconditional: 1607, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 2205, unknown conditional: 0, unknown unconditional: 2205] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L736] 0 _Bool z$r_buff1_thd4; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L743] 0 _Bool weak$$choice0; [L741] 0 int z$w_buff1; [L744] 0 _Bool weak$$choice2; [L725] 0 _Bool z$flush_delayed; [L739] 0 int z$w_buff0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L712] 0 int __unbuffered_p1_EAX = 0; [L727] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd3; [L726] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd4; [L737] 0 _Bool z$read_delayed; [L716] 0 int a = 0; [L738] 0 int *z$read_delayed_var; [L742] 0 _Bool z$w_buff1_used; [L710] 0 int __unbuffered_cnt = 0; [L718] 0 _Bool main$tmp_guard1; [L717] 0 _Bool main$tmp_guard0; [L740] 0 _Bool z$w_buff0_used; [L714] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1461, ((void *)0), P0, ((void *)0))=-1, t1461={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1462, ((void *)0), P1, ((void *)0))=0, t1461={5:0}, t1462={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1463, ((void *)0), P2, ((void *)0))=1, t1461={5:0}, t1462={6:0}, t1463={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1464, ((void *)0), P3, ((void *)0))=2, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L847] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L847] RET 0 assume_abort_if_not(main$tmp_guard0) [L849] 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) [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] 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 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1461={5:0}, t1462={6:0}, t1463={7:0}, t1464={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L871] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, 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: 839]: 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: 841]: 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: 837]: 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: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 579 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 579 mSDsluCounter, 284 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1495 IncrementalHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 96 mSDtfsCounter, 1495 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2282occurred in iteration=0, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 1124 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 2665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-16 20:06:23,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_084d3bdb-7c28-4872-91db-47ac67e10fdd/bin/utaipan-Xvt2sAort0/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