./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 02:38:49,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:38:49,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:38:49,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:38:49,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:38:49,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:38:49,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:38:49,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:38:49,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:38:49,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:38:49,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:38:49,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:38:49,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:38:49,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:38:49,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:38:49,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:38:49,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:38:49,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:38:49,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:38:49,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:38:49,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:38:49,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:38:49,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:38:49,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:38:49,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:38:49,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:38:49,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:38:49,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:38:49,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:38:49,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:38:49,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:38:49,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:38:49,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:38:49,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:38:49,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:38:49,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:38:49,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:38:49,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:38:49,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:38:49,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:38:49,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:38:49,525 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 02:38:49,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:38:49,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:38:49,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:38:49,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:38:49,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:38:49,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:38:49,552 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:38:49,552 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:38:49,552 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:38:49,552 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:38:49,553 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:38:49,553 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:38:49,553 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:38:49,553 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:38:49,553 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:38:49,554 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:38:49,554 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:38:49,554 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:38:49,555 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 02:38:49,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 02:38:49,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:38:49,556 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:38:49,556 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:38:49,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:38:49,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:38:49,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:38:49,557 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 02:38:49,557 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 02:38:49,557 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 02:38:49,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:38:49,558 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 02:38:49,558 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:38:49,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:38:49,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:38:49,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:38:49,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:38:49,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:38:49,560 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:38:49,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:38:49,560 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:38:49,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:38:49,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:38:49,561 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_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/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_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2022-11-22 02:38:49,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:38:49,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:38:49,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:38:49,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:38:49,912 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:38:49,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-11-22 02:38:53,119 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:38:53,436 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:38:53,437 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-11-22 02:38:53,460 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/data/d26623a10/177acd176987432ca6c33c95ed9f36bd/FLAGcf6718aac [2022-11-22 02:38:53,475 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/data/d26623a10/177acd176987432ca6c33c95ed9f36bd [2022-11-22 02:38:53,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:38:53,479 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:38:53,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:38:53,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:38:53,486 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:38:53,487 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:38:53" (1/1) ... [2022-11-22 02:38:53,488 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740f584e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:53, skipping insertion in model container [2022-11-22 02:38:53,488 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:38:53" (1/1) ... [2022-11-22 02:38:53,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:38:53,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:38:53,814 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2022-11-22 02:38:54,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:38:54,154 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:38:54,168 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2022-11-22 02:38:54,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:38:54,323 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:38:54,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54 WrapperNode [2022-11-22 02:38:54,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:38:54,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:38:54,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:38:54,326 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:38:54,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,383 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-11-22 02:38:54,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:38:54,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:38:54,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:38:54,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:38:54,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,446 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:38:54,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:38:54,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:38:54,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:38:54,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (1/1) ... [2022-11-22 02:38:54,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:38:54,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:38:54,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:38:54,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:38:54,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:38:54,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 02:38:54,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:38:54,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 02:38:54,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:38:54,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 02:38:54,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 02:38:54,585 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 02:38:54,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 02:38:54,585 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 02:38:54,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 02:38:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-22 02:38:54,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-22 02:38:54,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:38:54,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 02:38:54,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:38:54,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:38:54,590 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 02:38:54,837 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:38:54,839 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:38:55,299 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:38:55,554 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:38:55,554 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 02:38:55,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:38:55 BoogieIcfgContainer [2022-11-22 02:38:55,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:38:55,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:38:55,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:38:55,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:38:55,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:38:53" (1/3) ... [2022-11-22 02:38:55,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@949a4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:38:55, skipping insertion in model container [2022-11-22 02:38:55,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:54" (2/3) ... [2022-11-22 02:38:55,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@949a4a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:38:55, skipping insertion in model container [2022-11-22 02:38:55,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:38:55" (3/3) ... [2022-11-22 02:38:55,576 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2022-11-22 02:38:55,600 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:38:55,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-22 02:38:55,600 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 02:38:55,714 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 02:38:55,782 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 02:38:55,819 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 316 flow [2022-11-22 02:38:55,823 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 316 flow [2022-11-22 02:38:55,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 316 flow [2022-11-22 02:38:55,975 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-22 02:38:55,976 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 02:38:55,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2022-11-22 02:38:55,987 INFO L119 LiptonReduction]: Number of co-enabled transitions 3240 [2022-11-22 02:39:02,600 INFO L134 LiptonReduction]: Checked pairs total: 8205 [2022-11-22 02:39:02,601 INFO L136 LiptonReduction]: Total number of compositions: 146 [2022-11-22 02:39:02,609 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 42 transitions, 104 flow [2022-11-22 02:39:02,844 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3156 states, 3143 states have (on average 3.9910913140311806) internal successors, (12544), 3155 states have internal predecessors, (12544), 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-22 02:39:02,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:39:02,879 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@55f0c985, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:39:02,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-22 02:39:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 3156 states, 3143 states have (on average 3.9910913140311806) internal successors, (12544), 3155 states have internal predecessors, (12544), 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-22 02:39:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 02:39:02,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:02,902 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 02:39:02,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash 630, now seen corresponding path program 1 times [2022-11-22 02:39:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:02,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584796996] [2022-11-22 02:39:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:02,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:03,089 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-22 02:39:03,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:03,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584796996] [2022-11-22 02:39:03,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584796996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:03,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:03,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 02:39:03,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953711031] [2022-11-22 02:39:03,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:03,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 02:39:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:03,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 02:39:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 02:39:03,146 INFO L87 Difference]: Start difference. First operand has 3156 states, 3143 states have (on average 3.9910913140311806) internal successors, (12544), 3155 states have internal predecessors, (12544), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-22 02:39:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:03,317 INFO L93 Difference]: Finished difference Result 2986 states and 11584 transitions. [2022-11-22 02:39:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 02:39:03,320 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-22 02:39:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:03,373 INFO L225 Difference]: With dead ends: 2986 [2022-11-22 02:39:03,373 INFO L226 Difference]: Without dead ends: 2986 [2022-11-22 02:39:03,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 02:39:03,379 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:03,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:03,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2022-11-22 02:39:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2986. [2022-11-22 02:39:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2981 states have (on average 3.8859443139885945) internal successors, (11584), 2985 states have internal predecessors, (11584), 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-22 02:39:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 11584 transitions. [2022-11-22 02:39:03,695 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 11584 transitions. Word has length 1 [2022-11-22 02:39:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:03,697 INFO L495 AbstractCegarLoop]: Abstraction has 2986 states and 11584 transitions. [2022-11-22 02:39:03,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-22 02:39:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 11584 transitions. [2022-11-22 02:39:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 02:39:03,704 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:03,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:03,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:39:03,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:03,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:03,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1442380009, now seen corresponding path program 1 times [2022-11-22 02:39:03,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:03,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698818061] [2022-11-22 02:39:03,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:03,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:04,288 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-22 02:39:04,289 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:04,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698818061] [2022-11-22 02:39:04,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698818061] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:04,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:04,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:39:04,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567584706] [2022-11-22 02:39:04,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:04,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:39:04,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:04,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:39:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:39:04,292 INFO L87 Difference]: Start difference. First operand 2986 states and 11584 transitions. 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-22 02:39:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:04,424 INFO L93 Difference]: Finished difference Result 2538 states and 9744 transitions. [2022-11-22 02:39:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:39:04,425 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-22 02:39:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:04,445 INFO L225 Difference]: With dead ends: 2538 [2022-11-22 02:39:04,445 INFO L226 Difference]: Without dead ends: 2474 [2022-11-22 02:39:04,447 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-22 02:39:04,448 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:04,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2022-11-22 02:39:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2474. [2022-11-22 02:39:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2472 states have (on average 3.8576051779935274) internal successors, (9536), 2473 states have internal predecessors, (9536), 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-22 02:39:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 9536 transitions. [2022-11-22 02:39:04,644 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 9536 transitions. Word has length 9 [2022-11-22 02:39:04,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:04,645 INFO L495 AbstractCegarLoop]: Abstraction has 2474 states and 9536 transitions. [2022-11-22 02:39:04,645 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-22 02:39:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 9536 transitions. [2022-11-22 02:39:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:39:04,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:04,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:04,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:39:04,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:04,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1147137330, now seen corresponding path program 1 times [2022-11-22 02:39:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:04,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854552782] [2022-11-22 02:39:04,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:04,900 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-22 02:39:04,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:04,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854552782] [2022-11-22 02:39:04,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854552782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:04,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:04,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:39:04,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72321703] [2022-11-22 02:39:04,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:04,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:39:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:04,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:39:04,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:39:04,905 INFO L87 Difference]: Start difference. First operand 2474 states and 9536 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:05,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:05,074 INFO L93 Difference]: Finished difference Result 3194 states and 12064 transitions. [2022-11-22 02:39:05,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:39:05,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 02:39:05,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:05,103 INFO L225 Difference]: With dead ends: 3194 [2022-11-22 02:39:05,103 INFO L226 Difference]: Without dead ends: 3194 [2022-11-22 02:39:05,104 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-22 02:39:05,107 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:05,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2022-11-22 02:39:05,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2458. [2022-11-22 02:39:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2458 states, 2456 states have (on average 3.8501628664495113) internal successors, (9456), 2457 states have internal predecessors, (9456), 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-22 02:39:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 9456 transitions. [2022-11-22 02:39:05,289 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 9456 transitions. Word has length 11 [2022-11-22 02:39:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:05,290 INFO L495 AbstractCegarLoop]: Abstraction has 2458 states and 9456 transitions. [2022-11-22 02:39:05,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 9456 transitions. [2022-11-22 02:39:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:39:05,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:05,299 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:05,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:39:05,300 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:05,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1201517829, now seen corresponding path program 1 times [2022-11-22 02:39:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:05,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264957693] [2022-11-22 02:39:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:05,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:06,221 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-22 02:39:06,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:06,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264957693] [2022-11-22 02:39:06,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264957693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:06,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:06,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:39:06,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104546429] [2022-11-22 02:39:06,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:06,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:39:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:06,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:39:06,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:06,224 INFO L87 Difference]: Start difference. First operand 2458 states and 9456 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-22 02:39:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:06,595 INFO L93 Difference]: Finished difference Result 2474 states and 9216 transitions. [2022-11-22 02:39:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:39:06,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-22 02:39:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:06,647 INFO L225 Difference]: With dead ends: 2474 [2022-11-22 02:39:06,647 INFO L226 Difference]: Without dead ends: 2090 [2022-11-22 02:39:06,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:06,651 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:06,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 56 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:39:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2022-11-22 02:39:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2022-11-22 02:39:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2088 states have (on average 3.78544061302682) internal successors, (7904), 2089 states have internal predecessors, (7904), 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-22 02:39:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7904 transitions. [2022-11-22 02:39:06,737 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7904 transitions. Word has length 12 [2022-11-22 02:39:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:06,739 INFO L495 AbstractCegarLoop]: Abstraction has 2090 states and 7904 transitions. [2022-11-22 02:39:06,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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-22 02:39:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7904 transitions. [2022-11-22 02:39:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 02:39:06,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:06,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:06,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:39:06,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:06,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1404468015, now seen corresponding path program 1 times [2022-11-22 02:39:06,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:06,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53423195] [2022-11-22 02:39:06,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:07,024 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-22 02:39:07,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:07,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53423195] [2022-11-22 02:39:07,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53423195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:07,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:07,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908404064] [2022-11-22 02:39:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:07,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:39:07,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:07,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:39:07,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:39:07,026 INFO L87 Difference]: Start difference. First operand 2090 states and 7904 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-22 02:39:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:07,211 INFO L93 Difference]: Finished difference Result 1961 states and 6658 transitions. [2022-11-22 02:39:07,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:39:07,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-22 02:39:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:07,224 INFO L225 Difference]: With dead ends: 1961 [2022-11-22 02:39:07,225 INFO L226 Difference]: Without dead ends: 1577 [2022-11-22 02:39:07,225 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-22 02:39:07,226 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:07,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 15 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2022-11-22 02:39:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1577. [2022-11-22 02:39:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1575 states have (on average 3.38984126984127) internal successors, (5339), 1576 states have internal predecessors, (5339), 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-22 02:39:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 5339 transitions. [2022-11-22 02:39:07,287 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 5339 transitions. Word has length 13 [2022-11-22 02:39:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:07,288 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 5339 transitions. [2022-11-22 02:39:07,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-22 02:39:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 5339 transitions. [2022-11-22 02:39:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 02:39:07,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:07,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:07,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:39:07,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash -462661650, now seen corresponding path program 1 times [2022-11-22 02:39:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:07,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109884046] [2022-11-22 02:39:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:07,690 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-22 02:39:07,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:07,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109884046] [2022-11-22 02:39:07,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109884046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:07,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:07,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:39:07,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540953352] [2022-11-22 02:39:07,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:07,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:39:07,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:07,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:39:07,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:07,694 INFO L87 Difference]: Start difference. First operand 1577 states and 5339 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-22 02:39:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:07,911 INFO L93 Difference]: Finished difference Result 1178 states and 3553 transitions. [2022-11-22 02:39:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:39:07,912 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-22 02:39:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:07,931 INFO L225 Difference]: With dead ends: 1178 [2022-11-22 02:39:07,940 INFO L226 Difference]: Without dead ends: 929 [2022-11-22 02:39:07,940 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-22 02:39:07,941 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:07,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 21 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-11-22 02:39:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2022-11-22 02:39:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 927 states have (on average 2.9633225458468178) internal successors, (2747), 928 states have internal predecessors, (2747), 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-22 02:39:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 2747 transitions. [2022-11-22 02:39:07,991 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 2747 transitions. Word has length 16 [2022-11-22 02:39:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:07,992 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 2747 transitions. [2022-11-22 02:39:07,992 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-22 02:39:07,992 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 2747 transitions. [2022-11-22 02:39:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:39:07,996 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:07,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:07,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:39:07,997 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:07,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:07,998 INFO L85 PathProgramCache]: Analyzing trace with hash 739718247, now seen corresponding path program 1 times [2022-11-22 02:39:07,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:07,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854983079] [2022-11-22 02:39:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:07,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:08,349 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-22 02:39:08,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:08,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854983079] [2022-11-22 02:39:08,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854983079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:08,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:08,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:39:08,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701112681] [2022-11-22 02:39:08,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:08,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:39:08,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:08,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:39:08,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:39:08,353 INFO L87 Difference]: Start difference. First operand 929 states and 2747 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-22 02:39:08,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:08,573 INFO L93 Difference]: Finished difference Result 710 states and 2059 transitions. [2022-11-22 02:39:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:39:08,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2022-11-22 02:39:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:08,577 INFO L225 Difference]: With dead ends: 710 [2022-11-22 02:39:08,577 INFO L226 Difference]: Without dead ends: 623 [2022-11-22 02:39:08,578 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-22 02:39:08,579 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 103 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:08,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 24 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-11-22 02:39:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2022-11-22 02:39:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 621 states have (on average 2.9452495974235107) internal successors, (1829), 622 states have internal predecessors, (1829), 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-22 02:39:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1829 transitions. [2022-11-22 02:39:08,611 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1829 transitions. Word has length 19 [2022-11-22 02:39:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:08,611 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 1829 transitions. [2022-11-22 02:39:08,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-22 02:39:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1829 transitions. [2022-11-22 02:39:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:39:08,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:08,614 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] [2022-11-22 02:39:08,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 02:39:08,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:08,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash -97521116, now seen corresponding path program 1 times [2022-11-22 02:39:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:08,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138429289] [2022-11-22 02:39:08,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:08,862 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-22 02:39:08,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:08,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138429289] [2022-11-22 02:39:08,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138429289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:08,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:08,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:08,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805449684] [2022-11-22 02:39:08,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:08,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:39:08,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:08,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:39:08,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:39:08,864 INFO L87 Difference]: Start difference. First operand 623 states and 1829 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-22 02:39:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:09,022 INFO L93 Difference]: Finished difference Result 851 states and 2435 transitions. [2022-11-22 02:39:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:39:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-22 02:39:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:09,025 INFO L225 Difference]: With dead ends: 851 [2022-11-22 02:39:09,026 INFO L226 Difference]: Without dead ends: 851 [2022-11-22 02:39:09,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:39:09,026 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 45 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:09,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-11-22 02:39:09,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 711. [2022-11-22 02:39:09,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 709 states have (on average 2.8843441466854727) internal successors, (2045), 710 states have internal predecessors, (2045), 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-22 02:39:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 2045 transitions. [2022-11-22 02:39:09,051 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 2045 transitions. Word has length 22 [2022-11-22 02:39:09,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:09,051 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 2045 transitions. [2022-11-22 02:39:09,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-22 02:39:09,052 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 2045 transitions. [2022-11-22 02:39:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:39:09,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:09,054 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] [2022-11-22 02:39:09,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 02:39:09,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:09,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash -457694306, now seen corresponding path program 2 times [2022-11-22 02:39:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:09,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87750920] [2022-11-22 02:39:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:09,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:09,301 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-22 02:39:09,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:09,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87750920] [2022-11-22 02:39:09,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87750920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:09,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:09,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758166672] [2022-11-22 02:39:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:09,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:39:09,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:09,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:39:09,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:39:09,304 INFO L87 Difference]: Start difference. First operand 711 states and 2045 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-22 02:39:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:09,442 INFO L93 Difference]: Finished difference Result 949 states and 2666 transitions. [2022-11-22 02:39:09,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:39:09,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-11-22 02:39:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:09,446 INFO L225 Difference]: With dead ends: 949 [2022-11-22 02:39:09,447 INFO L226 Difference]: Without dead ends: 949 [2022-11-22 02:39:09,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-22 02:39:09,448 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 35 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:09,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 13 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:09,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2022-11-22 02:39:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 839. [2022-11-22 02:39:09,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 837 states have (on average 2.89247311827957) internal successors, (2421), 838 states have internal predecessors, (2421), 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-22 02:39:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 2421 transitions. [2022-11-22 02:39:09,481 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 2421 transitions. Word has length 22 [2022-11-22 02:39:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:09,481 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 2421 transitions. [2022-11-22 02:39:09,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-22 02:39:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 2421 transitions. [2022-11-22 02:39:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:39:09,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:09,485 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] [2022-11-22 02:39:09,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 02:39:09,485 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1423002030, now seen corresponding path program 1 times [2022-11-22 02:39:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:09,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522579624] [2022-11-22 02:39:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:09,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:09,722 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-22 02:39:09,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:09,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522579624] [2022-11-22 02:39:09,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522579624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:09,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:09,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:39:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060016937] [2022-11-22 02:39:09,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:09,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:39:09,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:09,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:39:09,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:09,729 INFO L87 Difference]: Start difference. First operand 839 states and 2421 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-22 02:39:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:09,932 INFO L93 Difference]: Finished difference Result 1108 states and 3098 transitions. [2022-11-22 02:39:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:39:09,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-11-22 02:39:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:09,937 INFO L225 Difference]: With dead ends: 1108 [2022-11-22 02:39:09,937 INFO L226 Difference]: Without dead ends: 1108 [2022-11-22 02:39:09,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:09,938 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:09,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 10 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2022-11-22 02:39:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 935. [2022-11-22 02:39:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 933 states have (on average 2.9035369774919615) internal successors, (2709), 934 states have internal predecessors, (2709), 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-22 02:39:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2709 transitions. [2022-11-22 02:39:09,980 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2709 transitions. Word has length 22 [2022-11-22 02:39:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:09,981 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 2709 transitions. [2022-11-22 02:39:09,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-22 02:39:09,982 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2709 transitions. [2022-11-22 02:39:09,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 02:39:09,985 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:09,985 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] [2022-11-22 02:39:09,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 02:39:09,985 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:09,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:09,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1793519592, now seen corresponding path program 3 times [2022-11-22 02:39:09,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:09,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635550087] [2022-11-22 02:39:09,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:10,342 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-22 02:39:10,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:10,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635550087] [2022-11-22 02:39:10,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635550087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:10,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:10,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:39:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798129585] [2022-11-22 02:39:10,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:10,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:39:10,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:10,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:39:10,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:10,345 INFO L87 Difference]: Start difference. First operand 935 states and 2709 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-22 02:39:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:10,553 INFO L93 Difference]: Finished difference Result 873 states and 2569 transitions. [2022-11-22 02:39:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:39:10,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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 22 [2022-11-22 02:39:10,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:10,557 INFO L225 Difference]: With dead ends: 873 [2022-11-22 02:39:10,557 INFO L226 Difference]: Without dead ends: 843 [2022-11-22 02:39:10,557 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-22 02:39:10,558 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:10,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 27 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-11-22 02:39:10,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 699. [2022-11-22 02:39:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 697 states have (on average 3.0071736011477763) internal successors, (2096), 698 states have internal predecessors, (2096), 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-22 02:39:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 2096 transitions. [2022-11-22 02:39:10,583 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 2096 transitions. Word has length 22 [2022-11-22 02:39:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:10,583 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 2096 transitions. [2022-11-22 02:39:10,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 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-22 02:39:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 2096 transitions. [2022-11-22 02:39:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:39:10,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:10,587 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-22 02:39:10,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 02:39:10,587 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1717652035, now seen corresponding path program 1 times [2022-11-22 02:39:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:10,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975465301] [2022-11-22 02:39:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:10,860 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-22 02:39:10,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:10,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975465301] [2022-11-22 02:39:10,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975465301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:10,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:10,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:39:10,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358864573] [2022-11-22 02:39:10,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:10,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:39:10,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:10,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:39:10,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:10,863 INFO L87 Difference]: Start difference. First operand 699 states and 2096 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-22 02:39:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:11,074 INFO L93 Difference]: Finished difference Result 963 states and 2800 transitions. [2022-11-22 02:39:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:39:11,075 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-22 02:39:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:11,078 INFO L225 Difference]: With dead ends: 963 [2022-11-22 02:39:11,078 INFO L226 Difference]: Without dead ends: 963 [2022-11-22 02:39:11,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:11,079 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:11,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 10 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2022-11-22 02:39:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 624. [2022-11-22 02:39:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 622 states have (on average 3.004823151125402) internal successors, (1869), 623 states have internal predecessors, (1869), 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-22 02:39:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1869 transitions. [2022-11-22 02:39:11,103 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1869 transitions. Word has length 25 [2022-11-22 02:39:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:11,103 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 1869 transitions. [2022-11-22 02:39:11,103 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-22 02:39:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1869 transitions. [2022-11-22 02:39:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:39:11,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:11,106 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-22 02:39:11,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 02:39:11,106 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1412898709, now seen corresponding path program 2 times [2022-11-22 02:39:11,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:11,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704673656] [2022-11-22 02:39:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:11,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:12,848 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-22 02:39:12,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:12,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704673656] [2022-11-22 02:39:12,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704673656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:12,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:12,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:39:12,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940928451] [2022-11-22 02:39:12,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:12,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:39:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:39:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:12,851 INFO L87 Difference]: Start difference. First operand 624 states and 1869 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:13,123 INFO L93 Difference]: Finished difference Result 710 states and 2068 transitions. [2022-11-22 02:39:13,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:39:13,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-22 02:39:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:13,126 INFO L225 Difference]: With dead ends: 710 [2022-11-22 02:39:13,126 INFO L226 Difference]: Without dead ends: 710 [2022-11-22 02:39:13,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:39:13,128 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:13,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 43 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-22 02:39:13,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 598. [2022-11-22 02:39:13,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 596 states have (on average 3.0167785234899327) internal successors, (1798), 597 states have internal predecessors, (1798), 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-22 02:39:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1798 transitions. [2022-11-22 02:39:13,155 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1798 transitions. Word has length 25 [2022-11-22 02:39:13,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:13,156 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 1798 transitions. [2022-11-22 02:39:13,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1798 transitions. [2022-11-22 02:39:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:39:13,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:13,159 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-22 02:39:13,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 02:39:13,159 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:13,160 INFO L85 PathProgramCache]: Analyzing trace with hash -935447339, now seen corresponding path program 3 times [2022-11-22 02:39:13,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:13,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655923099] [2022-11-22 02:39:13,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:13,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:39:13,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 02:39:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:39:13,377 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 02:39:13,378 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 02:39:13,379 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-22 02:39:13,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-22 02:39:13,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-22 02:39:13,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-22 02:39:13,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-22 02:39:13,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-22 02:39:13,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-22 02:39:13,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-22 02:39:13,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-22 02:39:13,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-22 02:39:13,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-22 02:39:13,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-22 02:39:13,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-22 02:39:13,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-22 02:39:13,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-22 02:39:13,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-22 02:39:13,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 02:39:13,389 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:13,396 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 02:39:13,396 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:39:13,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:39:13 BasicIcfg [2022-11-22 02:39:13,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:39:13,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:39:13,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:39:13,547 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:39:13,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:38:55" (3/4) ... [2022-11-22 02:39:13,551 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 02:39:13,551 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:39:13,552 INFO L158 Benchmark]: Toolchain (without parser) took 20072.77ms. Allocated memory was 165.7MB in the beginning and 383.8MB in the end (delta: 218.1MB). Free memory was 132.1MB in the beginning and 260.5MB in the end (delta: -128.3MB). Peak memory consumption was 90.8MB. Max. memory is 16.1GB. [2022-11-22 02:39:13,552 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 125.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:39:13,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 843.47ms. Allocated memory is still 165.7MB. Free memory was 131.4MB in the beginning and 121.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-22 02:39:13,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.67ms. Allocated memory is still 165.7MB. Free memory was 121.9MB in the beginning and 119.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:39:13,554 INFO L158 Benchmark]: Boogie Preprocessor took 81.09ms. Allocated memory is still 165.7MB. Free memory was 119.0MB in the beginning and 116.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:39:13,555 INFO L158 Benchmark]: RCFGBuilder took 1092.00ms. Allocated memory is still 165.7MB. Free memory was 116.8MB in the beginning and 78.8MB in the end (delta: 38.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-22 02:39:13,556 INFO L158 Benchmark]: TraceAbstraction took 17982.89ms. Allocated memory was 165.7MB in the beginning and 383.8MB in the end (delta: 218.1MB). Free memory was 77.9MB in the beginning and 261.5MB in the end (delta: -183.6MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2022-11-22 02:39:13,556 INFO L158 Benchmark]: Witness Printer took 4.73ms. Allocated memory is still 383.8MB. Free memory is still 260.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:39:13,558 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.23ms. Allocated memory is still 125.8MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 843.47ms. Allocated memory is still 165.7MB. Free memory was 131.4MB in the beginning and 121.9MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.67ms. Allocated memory is still 165.7MB. Free memory was 121.9MB in the beginning and 119.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.09ms. Allocated memory is still 165.7MB. Free memory was 119.0MB in the beginning and 116.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1092.00ms. Allocated memory is still 165.7MB. Free memory was 116.8MB in the beginning and 78.8MB in the end (delta: 38.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17982.89ms. Allocated memory was 165.7MB in the beginning and 383.8MB in the end (delta: 218.1MB). Free memory was 77.9MB in the beginning and 261.5MB in the end (delta: -183.6MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * Witness Printer took 4.73ms. Allocated memory is still 383.8MB. Free memory is still 260.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 159 PlacesBefore, 54 PlacesAfterwards, 148 TransitionsBefore, 42 TransitionsAfterwards, 3240 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 146 TotalNumberOfCompositions, 8205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4778, independent: 4583, independent conditional: 0, independent unconditional: 4583, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2472, independent: 2406, independent conditional: 0, independent unconditional: 2406, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2472, independent: 2376, independent conditional: 0, independent unconditional: 2376, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 96, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 594, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 516, dependent conditional: 0, dependent unconditional: 516, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4778, independent: 2177, independent conditional: 0, independent unconditional: 2177, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 2472, unknown conditional: 0, unknown unconditional: 2472] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 285, Positive conditional cache size: 0, Positive unconditional cache size: 285, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=8, t445={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] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=9, t445={5:0}, t446={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] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=10, t445={5:0}, t446={6:0}, t447={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] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=11, t445={5:0}, t446={6:0}, t447={7:0}, t448={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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L844] 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) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 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 [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 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 [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 873]: 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: 871]: 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: 869]: 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: 867]: 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, 182 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 161 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1613 IncrementalHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 79 mSDtfsCounter, 1613 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3156occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 1754 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 could not prove your program: unable to determine feasibility of some traces [2022-11-22 02:39:13,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-22 02:39:16,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:39:16,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:39:16,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:39:16,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:39:16,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:39:16,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:39:16,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:39:16,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:39:16,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:39:16,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:39:16,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:39:16,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:39:16,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:39:16,314 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:39:16,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:39:16,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:39:16,318 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:39:16,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:39:16,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:39:16,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:39:16,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:39:16,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:39:16,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:39:16,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:39:16,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:39:16,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:39:16,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:39:16,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:39:16,337 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:39:16,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:39:16,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:39:16,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:39:16,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:39:16,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:39:16,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:39:16,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:39:16,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:39:16,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:39:16,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:39:16,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:39:16,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-22 02:39:16,375 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:39:16,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:39:16,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:39:16,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:39:16,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:39:16,377 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:39:16,377 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:39:16,378 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:39:16,378 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:39:16,379 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:39:16,379 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:39:16,379 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:39:16,380 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 02:39:16,380 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 02:39:16,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:39:16,381 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:39:16,382 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:39:16,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:39:16,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:39:16,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:39:16,383 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 02:39:16,383 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 02:39:16,384 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 02:39:16,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:39:16,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 02:39:16,385 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-22 02:39:16,385 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-22 02:39:16,386 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:39:16,386 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:39:16,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:39:16,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-22 02:39:16,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:39:16,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:39:16,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:39:16,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:39:16,388 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-22 02:39:16,388 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-22 02:39:16,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:39:16,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-22 02:39:16,389 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/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_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2022-11-22 02:39:16,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:39:16,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:39:16,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:39:16,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:39:16,835 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:39:16,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-11-22 02:39:20,028 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:39:20,356 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:39:20,359 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2022-11-22 02:39:20,385 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/data/5bfc38fb5/bfbcd9306aee48878e0a5fb796f7f4f0/FLAGda2bcfdcd [2022-11-22 02:39:20,411 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/data/5bfc38fb5/bfbcd9306aee48878e0a5fb796f7f4f0 [2022-11-22 02:39:20,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:39:20,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:39:20,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:39:20,426 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:39:20,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:39:20,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:39:20" (1/1) ... [2022-11-22 02:39:20,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50cf4149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:20, skipping insertion in model container [2022-11-22 02:39:20,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:39:20" (1/1) ... [2022-11-22 02:39:20,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:39:20,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:39:20,708 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2022-11-22 02:39:21,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:39:21,086 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:39:21,103 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2022-11-22 02:39:21,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:39:21,260 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:39:21,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21 WrapperNode [2022-11-22 02:39:21,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:39:21,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:39:21,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:39:21,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:39:21,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,356 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-11-22 02:39:21,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:39:21,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:39:21,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:39:21,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:39:21,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,414 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:39:21,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:39:21,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:39:21,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:39:21,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (1/1) ... [2022-11-22 02:39:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:39:21,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:21,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:39:21,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:39:21,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-22 02:39:21,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:39:21,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 02:39:21,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:39:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-22 02:39:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-22 02:39:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-22 02:39:21,534 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-22 02:39:21,534 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-22 02:39:21,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-22 02:39:21,535 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-22 02:39:21,535 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-22 02:39:21,535 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-22 02:39:21,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-22 02:39:21,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-22 02:39:21,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:39:21,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:39:21,539 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 02:39:21,752 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:39:21,754 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:39:22,238 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:39:22,446 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:39:22,446 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-22 02:39:22,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:39:22 BoogieIcfgContainer [2022-11-22 02:39:22,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:39:22,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:39:22,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:39:22,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:39:22,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:39:20" (1/3) ... [2022-11-22 02:39:22,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb2295e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:39:22, skipping insertion in model container [2022-11-22 02:39:22,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:39:21" (2/3) ... [2022-11-22 02:39:22,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb2295e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:39:22, skipping insertion in model container [2022-11-22 02:39:22,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:39:22" (3/3) ... [2022-11-22 02:39:22,466 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2022-11-22 02:39:22,491 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:39:22,492 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-22 02:39:22,494 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 02:39:22,600 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-22 02:39:22,652 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 02:39:22,685 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-22 02:39:22,697 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-22 02:39:22,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-22 02:39:22,823 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-22 02:39:22,824 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-22 02:39:22,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2022-11-22 02:39:22,835 INFO L119 LiptonReduction]: Number of co-enabled transitions 3240 [2022-11-22 02:39:34,404 INFO L134 LiptonReduction]: Checked pairs total: 8207 [2022-11-22 02:39:34,404 INFO L136 LiptonReduction]: Total number of compositions: 149 [2022-11-22 02:39:34,413 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 42 transitions, 104 flow [2022-11-22 02:39:34,677 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3156 states, 3143 states have (on average 3.9910913140311806) internal successors, (12544), 3155 states have internal predecessors, (12544), 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-22 02:39:34,702 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:39:34,711 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6d02b646, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:39:34,711 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-22 02:39:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 3156 states, 3143 states have (on average 3.9910913140311806) internal successors, (12544), 3155 states have internal predecessors, (12544), 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-22 02:39:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-22 02:39:34,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:34,731 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-22 02:39:34,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash 633, now seen corresponding path program 1 times [2022-11-22 02:39:34,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:34,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777613955] [2022-11-22 02:39:34,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:34,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:34,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:34,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:34,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-22 02:39:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:34,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-22 02:39:34,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:34,868 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-22 02:39:34,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:39:34,869 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:39:34,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777613955] [2022-11-22 02:39:34,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777613955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:34,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:34,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-22 02:39:34,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301089077] [2022-11-22 02:39:34,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:34,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 02:39:34,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:39:34,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 02:39:34,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 02:39:34,913 INFO L87 Difference]: Start difference. First operand has 3156 states, 3143 states have (on average 3.9910913140311806) internal successors, (12544), 3155 states have internal predecessors, (12544), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-22 02:39:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:35,216 INFO L93 Difference]: Finished difference Result 2986 states and 11584 transitions. [2022-11-22 02:39:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 02:39:35,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-22 02:39:35,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:35,272 INFO L225 Difference]: With dead ends: 2986 [2022-11-22 02:39:35,273 INFO L226 Difference]: Without dead ends: 2986 [2022-11-22 02:39:35,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 02:39:35,281 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:35,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2022-11-22 02:39:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2986. [2022-11-22 02:39:35,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2981 states have (on average 3.8859443139885945) internal successors, (11584), 2985 states have internal predecessors, (11584), 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-22 02:39:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 11584 transitions. [2022-11-22 02:39:35,546 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 11584 transitions. Word has length 1 [2022-11-22 02:39:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:35,547 INFO L495 AbstractCegarLoop]: Abstraction has 2986 states and 11584 transitions. [2022-11-22 02:39:35,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-22 02:39:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 11584 transitions. [2022-11-22 02:39:35,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 02:39:35,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:35,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:35,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-22 02:39:35,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:35,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:35,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:35,760 INFO L85 PathProgramCache]: Analyzing trace with hash 387425214, now seen corresponding path program 1 times [2022-11-22 02:39:35,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:35,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209677551] [2022-11-22 02:39:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:35,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:35,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:35,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:35,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-22 02:39:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:35,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:39:35,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:36,044 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-22 02:39:36,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:39:36,045 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:39:36,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209677551] [2022-11-22 02:39:36,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209677551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:36,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:36,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:39:36,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632818026] [2022-11-22 02:39:36,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:36,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:39:36,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:39:36,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:39:36,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:39:36,049 INFO L87 Difference]: Start difference. First operand 2986 states and 11584 transitions. 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-22 02:39:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:36,262 INFO L93 Difference]: Finished difference Result 2538 states and 9744 transitions. [2022-11-22 02:39:36,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:39:36,263 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-22 02:39:36,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:36,282 INFO L225 Difference]: With dead ends: 2538 [2022-11-22 02:39:36,282 INFO L226 Difference]: Without dead ends: 2474 [2022-11-22 02:39:36,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-22 02:39:36,284 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:36,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2022-11-22 02:39:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2474. [2022-11-22 02:39:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2472 states have (on average 3.8576051779935274) internal successors, (9536), 2473 states have internal predecessors, (9536), 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-22 02:39:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 9536 transitions. [2022-11-22 02:39:36,438 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 9536 transitions. Word has length 9 [2022-11-22 02:39:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:36,439 INFO L495 AbstractCegarLoop]: Abstraction has 2474 states and 9536 transitions. [2022-11-22 02:39:36,441 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-22 02:39:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 9536 transitions. [2022-11-22 02:39:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 02:39:36,447 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:36,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:36,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:36,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:36,660 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1346416226, now seen corresponding path program 1 times [2022-11-22 02:39:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:36,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1770786310] [2022-11-22 02:39:36,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:36,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:36,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:36,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:36,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-22 02:39:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:36,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 02:39:36,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:36,930 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-22 02:39:36,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:39:36,932 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:39:36,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1770786310] [2022-11-22 02:39:36,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1770786310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:36,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:36,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:36,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15376039] [2022-11-22 02:39:36,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:36,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:39:36,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:39:36,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:39:36,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:39:36,938 INFO L87 Difference]: Start difference. First operand 2474 states and 9536 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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-22 02:39:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:37,214 INFO L93 Difference]: Finished difference Result 2183 states and 7480 transitions. [2022-11-22 02:39:37,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:39:37,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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-22 02:39:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:37,249 INFO L225 Difference]: With dead ends: 2183 [2022-11-22 02:39:37,249 INFO L226 Difference]: Without dead ends: 1799 [2022-11-22 02:39:37,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-22 02:39:37,253 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:37,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 15 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2022-11-22 02:39:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2022-11-22 02:39:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1797 states have (on average 3.428491930996105) internal successors, (6161), 1798 states have internal predecessors, (6161), 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-22 02:39:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 6161 transitions. [2022-11-22 02:39:37,423 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 6161 transitions. Word has length 11 [2022-11-22 02:39:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:37,424 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 6161 transitions. [2022-11-22 02:39:37,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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-22 02:39:37,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 6161 transitions. [2022-11-22 02:39:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:39:37,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:37,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:37,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:37,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:37,630 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2010639596, now seen corresponding path program 1 times [2022-11-22 02:39:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:37,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408924695] [2022-11-22 02:39:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:37,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:37,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:37,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:37,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-22 02:39:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:37,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:39:37,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:37,861 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-22 02:39:37,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:39:37,862 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:39:37,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408924695] [2022-11-22 02:39:37,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408924695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:37,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:37,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:39:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425658617] [2022-11-22 02:39:37,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:37,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:39:37,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:39:37,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:39:37,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:37,865 INFO L87 Difference]: Start difference. First operand 1799 states and 6161 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:38,144 INFO L93 Difference]: Finished difference Result 1238 states and 3727 transitions. [2022-11-22 02:39:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:39:38,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 02:39:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:38,181 INFO L225 Difference]: With dead ends: 1238 [2022-11-22 02:39:38,181 INFO L226 Difference]: Without dead ends: 989 [2022-11-22 02:39:38,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:39:38,182 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:38,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 27 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:38,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-11-22 02:39:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2022-11-22 02:39:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 987 states have (on average 2.9594731509625127) internal successors, (2921), 988 states have internal predecessors, (2921), 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-22 02:39:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2921 transitions. [2022-11-22 02:39:38,235 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 2921 transitions. Word has length 14 [2022-11-22 02:39:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:38,235 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 2921 transitions. [2022-11-22 02:39:38,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:38,235 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 2921 transitions. [2022-11-22 02:39:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:39:38,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:38,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:38,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:38,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:38,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:38,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1808811576, now seen corresponding path program 1 times [2022-11-22 02:39:38,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:38,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091960539] [2022-11-22 02:39:38,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:38,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:38,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:38,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:38,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-22 02:39:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:38,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-22 02:39:38,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:38,675 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-22 02:39:38,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:39:38,676 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:39:38,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091960539] [2022-11-22 02:39:38,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091960539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:38,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:38,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:39:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253111907] [2022-11-22 02:39:38,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:38,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 02:39:38,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:39:38,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 02:39:38,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-22 02:39:38,679 INFO L87 Difference]: Start difference. First operand 989 states and 2921 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:39,077 INFO L93 Difference]: Finished difference Result 716 states and 2071 transitions. [2022-11-22 02:39:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:39:39,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 02:39:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:39,082 INFO L225 Difference]: With dead ends: 716 [2022-11-22 02:39:39,082 INFO L226 Difference]: Without dead ends: 629 [2022-11-22 02:39:39,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:39,083 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 65 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:39,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 48 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:39:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-11-22 02:39:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2022-11-22 02:39:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 627 states have (on average 2.9362041467304625) internal successors, (1841), 628 states have internal predecessors, (1841), 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-22 02:39:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1841 transitions. [2022-11-22 02:39:39,103 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1841 transitions. Word has length 17 [2022-11-22 02:39:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:39,104 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 1841 transitions. [2022-11-22 02:39:39,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1841 transitions. [2022-11-22 02:39:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:39:39,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:39,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:39,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:39,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:39,318 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:39,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash -2123898808, now seen corresponding path program 1 times [2022-11-22 02:39:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:39,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443449875] [2022-11-22 02:39:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:39,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:39,323 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:39,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-22 02:39:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:39,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-22 02:39:39,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:39,566 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-22 02:39:39,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:39:39,567 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:39:39,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443449875] [2022-11-22 02:39:39,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443449875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:39,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:39,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:39:39,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385717179] [2022-11-22 02:39:39,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:39,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:39:39,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:39:39,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:39:39,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:39,574 INFO L87 Difference]: Start difference. First operand 629 states and 1841 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:40,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:40,077 INFO L93 Difference]: Finished difference Result 574 states and 1729 transitions. [2022-11-22 02:39:40,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:39:40,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 02:39:40,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:40,081 INFO L225 Difference]: With dead ends: 574 [2022-11-22 02:39:40,082 INFO L226 Difference]: Without dead ends: 559 [2022-11-22 02:39:40,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:39:40,083 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 61 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:40,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 72 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:39:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-11-22 02:39:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2022-11-22 02:39:40,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 557 states have (on average 3.0538599640933572) internal successors, (1701), 558 states have internal predecessors, (1701), 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-22 02:39:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1701 transitions. [2022-11-22 02:39:40,109 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1701 transitions. Word has length 20 [2022-11-22 02:39:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:40,109 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 1701 transitions. [2022-11-22 02:39:40,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1701 transitions. [2022-11-22 02:39:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:39:40,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:40,113 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-22 02:39:40,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:40,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:40,335 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:40,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -188490966, now seen corresponding path program 1 times [2022-11-22 02:39:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:40,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447043759] [2022-11-22 02:39:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:40,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:40,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:40,340 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:40,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-22 02:39:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:40,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:39:40,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:40,584 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-22 02:39:40,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:39:40,585 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:39:40,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447043759] [2022-11-22 02:39:40,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447043759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:40,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:40,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16900402] [2022-11-22 02:39:40,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:40,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:39:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:39:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:39:40,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:39:40,588 INFO L87 Difference]: Start difference. First operand 559 states and 1701 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-22 02:39:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:40,785 INFO L93 Difference]: Finished difference Result 767 states and 2267 transitions. [2022-11-22 02:39:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:39:40,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-22 02:39:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:40,790 INFO L225 Difference]: With dead ends: 767 [2022-11-22 02:39:40,791 INFO L226 Difference]: Without dead ends: 767 [2022-11-22 02:39:40,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-22 02:39:40,792 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:40,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 10 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-11-22 02:39:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 765. [2022-11-22 02:39:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 763 states have (on average 2.9698558322411532) internal successors, (2266), 764 states have internal predecessors, (2266), 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-22 02:39:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 2266 transitions. [2022-11-22 02:39:40,824 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 2266 transitions. Word has length 25 [2022-11-22 02:39:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:40,824 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 2266 transitions. [2022-11-22 02:39:40,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-22 02:39:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 2266 transitions. [2022-11-22 02:39:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:39:40,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:40,827 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-22 02:39:40,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:41,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:41,040 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:41,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2044090598, now seen corresponding path program 2 times [2022-11-22 02:39:41,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:41,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209629702] [2022-11-22 02:39:41,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 02:39:41,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:41,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:41,043 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:41,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-22 02:39:41,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 02:39:41,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:39:41,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:39:41,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:41,256 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-22 02:39:41,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:39:41,256 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:39:41,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209629702] [2022-11-22 02:39:41,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209629702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:41,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:41,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:41,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738149871] [2022-11-22 02:39:41,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:41,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:39:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:39:41,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:39:41,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:39:41,259 INFO L87 Difference]: Start difference. First operand 765 states and 2266 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-22 02:39:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:41,443 INFO L93 Difference]: Finished difference Result 1059 states and 3053 transitions. [2022-11-22 02:39:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:39:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-22 02:39:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:41,450 INFO L225 Difference]: With dead ends: 1059 [2022-11-22 02:39:41,450 INFO L226 Difference]: Without dead ends: 1059 [2022-11-22 02:39:41,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-22 02:39:41,451 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:41,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 13 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2022-11-22 02:39:41,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 717. [2022-11-22 02:39:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 715 states have (on average 2.965034965034965) internal successors, (2120), 716 states have internal predecessors, (2120), 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-22 02:39:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 2120 transitions. [2022-11-22 02:39:41,477 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 2120 transitions. Word has length 25 [2022-11-22 02:39:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:41,477 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 2120 transitions. [2022-11-22 02:39:41,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-22 02:39:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 2120 transitions. [2022-11-22 02:39:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:39:41,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:41,480 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-22 02:39:41,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-22 02:39:41,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:41,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:41,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:41,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1054135054, now seen corresponding path program 3 times [2022-11-22 02:39:41,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:41,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521549830] [2022-11-22 02:39:41,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:39:41,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:41,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:41,695 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:41,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-22 02:39:41,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-22 02:39:41,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:39:41,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:39:41,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:41,924 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-22 02:39:41,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:39:41,925 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:39:41,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521549830] [2022-11-22 02:39:41,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521549830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:41,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:41,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:41,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854606797] [2022-11-22 02:39:41,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:41,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:39:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:39:41,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:39:41,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:39:41,927 INFO L87 Difference]: Start difference. First operand 717 states and 2120 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-22 02:39:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:42,103 INFO L93 Difference]: Finished difference Result 921 states and 2670 transitions. [2022-11-22 02:39:42,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:39:42,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-22 02:39:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:42,110 INFO L225 Difference]: With dead ends: 921 [2022-11-22 02:39:42,110 INFO L226 Difference]: Without dead ends: 921 [2022-11-22 02:39:42,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-22 02:39:42,111 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:42,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:39:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-11-22 02:39:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 624. [2022-11-22 02:39:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 622 states have (on average 3.004823151125402) internal successors, (1869), 623 states have internal predecessors, (1869), 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-22 02:39:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1869 transitions. [2022-11-22 02:39:42,135 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1869 transitions. Word has length 25 [2022-11-22 02:39:42,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:42,135 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 1869 transitions. [2022-11-22 02:39:42,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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-22 02:39:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1869 transitions. [2022-11-22 02:39:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:39:42,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:42,138 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-22 02:39:42,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:42,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:42,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:42,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1553502992, now seen corresponding path program 4 times [2022-11-22 02:39:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:42,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687107608] [2022-11-22 02:39:42,353 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:39:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:42,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:42,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:42,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-22 02:39:42,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:39:42,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:39:42,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-22 02:39:42,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:43,447 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-22 02:39:43,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 02:39:43,448 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:39:43,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687107608] [2022-11-22 02:39:43,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687107608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:43,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:43,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:39:43,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867807233] [2022-11-22 02:39:43,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:43,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:39:43,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:39:43,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:39:43,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:43,450 INFO L87 Difference]: Start difference. First operand 624 states and 1869 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:43,872 INFO L93 Difference]: Finished difference Result 710 states and 2068 transitions. [2022-11-22 02:39:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:39:43,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-22 02:39:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:43,877 INFO L225 Difference]: With dead ends: 710 [2022-11-22 02:39:43,877 INFO L226 Difference]: Without dead ends: 710 [2022-11-22 02:39:43,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:39:43,878 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:43,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 45 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:39:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-11-22 02:39:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 598. [2022-11-22 02:39:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 596 states have (on average 3.0167785234899327) internal successors, (1798), 597 states have internal predecessors, (1798), 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-22 02:39:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1798 transitions. [2022-11-22 02:39:43,897 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1798 transitions. Word has length 25 [2022-11-22 02:39:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:43,898 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 1798 transitions. [2022-11-22 02:39:43,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:43,898 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1798 transitions. [2022-11-22 02:39:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-22 02:39:43,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:43,901 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-22 02:39:43,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:44,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:44,115 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-22 02:39:44,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash 578910096, now seen corresponding path program 5 times [2022-11-22 02:39:44,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:39:44,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726982452] [2022-11-22 02:39:44,116 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-22 02:39:44,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:44,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:39:44,118 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-22 02:39:44,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-22 02:39:44,370 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-22 02:39:44,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-22 02:39:44,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 02:39:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:39:44,600 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-22 02:39:44,600 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 02:39:44,601 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-22 02:39:44,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-22 02:39:44,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-22 02:39:44,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-22 02:39:44,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-22 02:39:44,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-22 02:39:44,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-22 02:39:44,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-22 02:39:44,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-22 02:39:44,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-22 02:39:44,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-22 02:39:44,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-22 02:39:44,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-22 02:39:44,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-22 02:39:44,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-22 02:39:44,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-22 02:39:44,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:44,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-22 02:39:44,823 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:44,827 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-22 02:39:44,827 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:39:44,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:39:44 BasicIcfg [2022-11-22 02:39:44,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:39:44,924 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:39:44,924 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:39:44,925 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:39:44,925 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:39:22" (3/4) ... [2022-11-22 02:39:44,928 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 02:39:44,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:39:44,929 INFO L158 Benchmark]: Toolchain (without parser) took 24507.79ms. Allocated memory was 75.5MB in the beginning and 262.1MB in the end (delta: 186.6MB). Free memory was 52.7MB in the beginning and 162.0MB in the end (delta: -109.3MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2022-11-22 02:39:44,929 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 52.4MB. Free memory was 30.5MB in the beginning and 30.5MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:39:44,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 837.78ms. Allocated memory is still 75.5MB. Free memory was 52.5MB in the beginning and 47.7MB in the end (delta: 4.8MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-11-22 02:39:44,930 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.99ms. Allocated memory is still 75.5MB. Free memory was 47.7MB in the beginning and 44.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:39:44,930 INFO L158 Benchmark]: Boogie Preprocessor took 75.24ms. Allocated memory is still 75.5MB. Free memory was 44.9MB in the beginning and 42.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:39:44,931 INFO L158 Benchmark]: RCFGBuilder took 1017.00ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 42.5MB in the beginning and 59.3MB in the end (delta: -16.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-22 02:39:44,931 INFO L158 Benchmark]: TraceAbstraction took 22469.48ms. Allocated memory was 92.3MB in the beginning and 262.1MB in the end (delta: 169.9MB). Free memory was 58.7MB in the beginning and 163.1MB in the end (delta: -104.4MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2022-11-22 02:39:44,931 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 262.1MB. Free memory was 163.1MB in the beginning and 162.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:39:44,933 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.27ms. Allocated memory is still 52.4MB. Free memory was 30.5MB in the beginning and 30.5MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 837.78ms. Allocated memory is still 75.5MB. Free memory was 52.5MB in the beginning and 47.7MB in the end (delta: 4.8MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.99ms. Allocated memory is still 75.5MB. Free memory was 47.7MB in the beginning and 44.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.24ms. Allocated memory is still 75.5MB. Free memory was 44.9MB in the beginning and 42.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1017.00ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 42.5MB in the beginning and 59.3MB in the end (delta: -16.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22469.48ms. Allocated memory was 92.3MB in the beginning and 262.1MB in the end (delta: 169.9MB). Free memory was 58.7MB in the beginning and 163.1MB in the end (delta: -104.4MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 262.1MB. Free memory was 163.1MB in the beginning and 162.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.7s, 160 PlacesBefore, 54 PlacesAfterwards, 149 TransitionsBefore, 42 TransitionsAfterwards, 3240 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 149 TotalNumberOfCompositions, 8207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4704, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2461, independent: 2393, independent conditional: 0, independent unconditional: 2393, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2461, independent: 2363, independent conditional: 0, independent unconditional: 2363, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 580, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 517, dependent conditional: 0, dependent unconditional: 517, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4704, independent: 2116, independent conditional: 0, independent unconditional: 2116, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 2461, unknown conditional: 0, unknown unconditional: 2461] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 279, Positive conditional cache size: 0, Positive unconditional cache size: 279, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=0, t445={-16: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] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=1, t445={-16:0}, t446={-12: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] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=2, t445={-16:0}, t446={-12:0}, t447={-2: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] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=3, t445={-16:0}, t446={-12:0}, t447={-2:0}, t448={-4: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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=4, weak$$choice2=2, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=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=4, weak$$choice2=2, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=2, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L844] 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) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 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 [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 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 [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={-16:0}, t446={-12:0}, t447={-2:0}, t448={-4:0}, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 873]: 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: 871]: 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: 869]: 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: 867]: 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, 183 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 362 mSDsluCounter, 249 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1526 IncrementalHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 78 mSDtfsCounter, 1526 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3156occurred in iteration=0, InterpolantAutomatonStates: 50, 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, 10 MinimizatonAttempts, 753 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 768 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1521 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-22 02:39:44,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b5fac140-e411-4770-8008-2bca297cbee9/bin/utaipan-g80aRyZoba/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 Result: UNKNOWN: Overapproximated counterexample