./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS --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 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:09:57,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:09:57,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:09:57,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:09:57,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:09:57,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:09:57,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:09:57,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:09:57,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:09:57,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:09:57,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:09:57,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:09:57,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:09:57,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:09:57,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:09:57,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:09:57,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:09:57,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:09:57,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:09:57,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:09:57,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:09:57,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:09:57,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:09:57,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:09:57,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:09:57,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:09:57,543 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:09:57,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:09:57,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:09:57,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:09:57,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:09:57,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:09:57,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:09:57,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:09:57,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:09:57,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:09:57,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:09:57,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:09:57,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:09:57,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:09:57,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:09:57,553 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 07:09:57,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:09:57,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:09:57,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:09:57,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:09:57,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:09:57,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:09:57,577 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:09:57,577 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:09:57,577 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:09:57,577 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:09:57,578 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:09:57,578 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:09:57,578 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:09:57,578 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:09:57,578 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:09:57,579 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:09:57,579 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:09:57,579 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:09:57,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:09:57,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:09:57,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:09:57,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:09:57,581 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:09:57,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:09:57,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:09:57,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:09:57,582 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:09:57,582 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:09:57,582 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:09:57,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:09:57,583 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:09:57,583 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:09:57,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:09:57,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:09:57,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:09:57,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:09:57,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:09:57,584 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:09:57,584 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:09:57,585 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:09:57,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:09:57,585 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:09:57,585 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_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 [2022-11-19 07:09:57,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:09:57,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:09:57,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:09:57,892 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:09:57,893 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:09:57,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-19 07:09:57,975 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/data/3eab744cd/9dc8e4310e794cb794ff96c0b9a284db/FLAGeec4b62ae [2022-11-19 07:09:58,543 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:09:58,553 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-19 07:09:58,574 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/data/3eab744cd/9dc8e4310e794cb794ff96c0b9a284db/FLAGeec4b62ae [2022-11-19 07:09:58,851 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/data/3eab744cd/9dc8e4310e794cb794ff96c0b9a284db [2022-11-19 07:09:58,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:09:58,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:09:58,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:09:58,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:09:58,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:09:58,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:58" (1/1) ... [2022-11-19 07:09:58,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2fb7c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:58, skipping insertion in model container [2022-11-19 07:09:58,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:09:58" (1/1) ... [2022-11-19 07:09:58,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:09:58,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:09:59,182 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-19 07:09:59,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:09:59,501 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:09:59,517 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-19 07:09:59,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:09:59,633 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:09:59,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59 WrapperNode [2022-11-19 07:09:59,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:09:59,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:09:59,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:09:59,635 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:09:59,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,721 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-19 07:09:59,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:09:59,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:09:59,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:09:59,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:09:59,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,783 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:09:59,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:09:59,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:09:59,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:09:59,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (1/1) ... [2022-11-19 07:09:59,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:09:59,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:09:59,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:09:59,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:09:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:09:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:09:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:09:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:09:59,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:09:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:09:59,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:09:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:09:59,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:09:59,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:09:59,876 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:09:59,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:09:59,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:09:59,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:09:59,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:09:59,878 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:10:00,067 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:10:00,070 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:10:00,445 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:10:00,647 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:10:00,649 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:10:00,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:10:00 BoogieIcfgContainer [2022-11-19 07:10:00,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:10:00,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:10:00,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:10:00,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:10:00,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:09:58" (1/3) ... [2022-11-19 07:10:00,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7a450f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:10:00, skipping insertion in model container [2022-11-19 07:10:00,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:09:59" (2/3) ... [2022-11-19 07:10:00,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7a450f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:10:00, skipping insertion in model container [2022-11-19 07:10:00,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:10:00" (3/3) ... [2022-11-19 07:10:00,663 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2022-11-19 07:10:00,683 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:10:00,684 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-19 07:10:00,684 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:10:00,771 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:10:00,805 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:10:00,820 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 129 transitions, 273 flow [2022-11-19 07:10:00,823 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 129 transitions, 273 flow [2022-11-19 07:10:00,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2022-11-19 07:10:00,880 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-19 07:10:00,880 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:10:00,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-19 07:10:00,888 INFO L119 LiptonReduction]: Number of co-enabled transitions 2364 [2022-11-19 07:10:07,256 INFO L134 LiptonReduction]: Checked pairs total: 5667 [2022-11-19 07:10:07,256 INFO L136 LiptonReduction]: Total number of compositions: 131 [2022-11-19 07:10:07,268 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 33 transitions, 81 flow [2022-11-19 07:10:07,362 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 884 states, 871 states have (on average 3.1504018369690012) internal successors, (2744), 883 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:07,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:10:07,399 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;@34e763d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:10:07,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-19 07:10:07,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 871 states have (on average 3.1504018369690012) internal successors, (2744), 883 states have internal predecessors, (2744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:10:07,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:07,410 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:10:07,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:07,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash 547, now seen corresponding path program 1 times [2022-11-19 07:10:07,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:07,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548286343] [2022-11-19 07:10:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:07,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:07,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-19 07:10:07,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:07,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548286343] [2022-11-19 07:10:07,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548286343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:07,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:07,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:10:07,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666314564] [2022-11-19 07:10:07,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:07,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:10:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:07,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:10:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:10:07,609 INFO L87 Difference]: Start difference. First operand has 884 states, 871 states have (on average 3.1504018369690012) internal successors, (2744), 883 states have internal predecessors, (2744), 0 states have call successors, (0), 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-19 07:10:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:07,725 INFO L93 Difference]: Finished difference Result 826 states and 2604 transitions. [2022-11-19 07:10:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:10:07,728 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-19 07:10:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:07,758 INFO L225 Difference]: With dead ends: 826 [2022-11-19 07:10:07,758 INFO L226 Difference]: Without dead ends: 826 [2022-11-19 07:10:07,759 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-19 07:10:07,763 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:07,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-11-19 07:10:07,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2022-11-19 07:10:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 821 states have (on average 3.171741778319123) internal successors, (2604), 825 states have internal predecessors, (2604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2604 transitions. [2022-11-19 07:10:07,883 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2604 transitions. Word has length 1 [2022-11-19 07:10:07,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:07,884 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 2604 transitions. [2022-11-19 07:10:07,887 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-19 07:10:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2604 transitions. [2022-11-19 07:10:07,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:10:07,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:07,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:10:07,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:10:07,891 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:07,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash 516170350, now seen corresponding path program 1 times [2022-11-19 07:10:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:07,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338904912] [2022-11-19 07:10:07,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:07,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:08,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:08,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338904912] [2022-11-19 07:10:08,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338904912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:08,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:08,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:10:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113517435] [2022-11-19 07:10:08,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:08,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:10:08,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:08,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:10:08,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:10:08,250 INFO L87 Difference]: Start difference. First operand 826 states and 2604 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:08,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:08,337 INFO L93 Difference]: Finished difference Result 674 states and 2090 transitions. [2022-11-19 07:10:08,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:10:08,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 07:10:08,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:08,342 INFO L225 Difference]: With dead ends: 674 [2022-11-19 07:10:08,342 INFO L226 Difference]: Without dead ends: 650 [2022-11-19 07:10:08,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:10:08,344 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:08,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-11-19 07:10:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-11-19 07:10:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 3.1296296296296298) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2022-11-19 07:10:08,367 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 5 [2022-11-19 07:10:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:08,368 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2022-11-19 07:10:08,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2022-11-19 07:10:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:10:08,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:08,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:08,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:10:08,370 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 114760325, now seen corresponding path program 1 times [2022-11-19 07:10:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:08,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113932638] [2022-11-19 07:10:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:08,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:08,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113932638] [2022-11-19 07:10:08,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113932638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:08,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:08,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:10:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693291210] [2022-11-19 07:10:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:08,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:10:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:10:08,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:10:08,682 INFO L87 Difference]: Start difference. First operand 650 states and 2028 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-19 07:10:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:08,773 INFO L93 Difference]: Finished difference Result 754 states and 2258 transitions. [2022-11-19 07:10:08,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:10:08,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 07:10:08,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:08,778 INFO L225 Difference]: With dead ends: 754 [2022-11-19 07:10:08,778 INFO L226 Difference]: Without dead ends: 754 [2022-11-19 07:10:08,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:10:08,783 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:08,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2022-11-19 07:10:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 642. [2022-11-19 07:10:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 640 states have (on average 3.11875) internal successors, (1996), 641 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1996 transitions. [2022-11-19 07:10:08,809 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1996 transitions. Word has length 9 [2022-11-19 07:10:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:08,811 INFO L495 AbstractCegarLoop]: Abstraction has 642 states and 1996 transitions. [2022-11-19 07:10:08,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1996 transitions. [2022-11-19 07:10:08,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 07:10:08,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:08,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:08,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:10:08,814 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:08,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:08,815 INFO L85 PathProgramCache]: Analyzing trace with hash 114760344, now seen corresponding path program 1 times [2022-11-19 07:10:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:08,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552472305] [2022-11-19 07:10:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:09,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:09,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552472305] [2022-11-19 07:10:09,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552472305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:09,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:09,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10632361] [2022-11-19 07:10:09,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:09,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:09,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:09,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:09,202 INFO L87 Difference]: Start difference. First operand 642 states and 1996 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:09,369 INFO L93 Difference]: Finished difference Result 522 states and 1590 transitions. [2022-11-19 07:10:09,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:09,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 07:10:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:09,375 INFO L225 Difference]: With dead ends: 522 [2022-11-19 07:10:09,376 INFO L226 Difference]: Without dead ends: 522 [2022-11-19 07:10:09,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:09,378 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:09,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-11-19 07:10:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2022-11-19 07:10:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 521 states have (on average 3.0518234165067177) internal successors, (1590), 521 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1590 transitions. [2022-11-19 07:10:09,401 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1590 transitions. Word has length 9 [2022-11-19 07:10:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:09,401 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 1590 transitions. [2022-11-19 07:10:09,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1590 transitions. [2022-11-19 07:10:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:10:09,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:09,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:09,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:10:09,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 517064722, now seen corresponding path program 1 times [2022-11-19 07:10:09,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:09,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149211661] [2022-11-19 07:10:09,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:09,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:09,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:09,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:09,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149211661] [2022-11-19 07:10:09,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149211661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:09,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:09,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:10:09,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159177244] [2022-11-19 07:10:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:09,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:10:09,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:09,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:10:09,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:10:09,663 INFO L87 Difference]: Start difference. First operand 522 states and 1590 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:09,725 INFO L93 Difference]: Finished difference Result 490 states and 1480 transitions. [2022-11-19 07:10:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:10:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-19 07:10:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:09,729 INFO L225 Difference]: With dead ends: 490 [2022-11-19 07:10:09,729 INFO L226 Difference]: Without dead ends: 490 [2022-11-19 07:10:09,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:10:09,730 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:09,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-11-19 07:10:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2022-11-19 07:10:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 3.0265848670756648) internal successors, (1480), 489 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1480 transitions. [2022-11-19 07:10:09,747 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1480 transitions. Word has length 11 [2022-11-19 07:10:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:09,747 INFO L495 AbstractCegarLoop]: Abstraction has 490 states and 1480 transitions. [2022-11-19 07:10:09,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1480 transitions. [2022-11-19 07:10:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:10:09,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:09,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:09,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:10:09,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:09,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:09,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1384565097, now seen corresponding path program 1 times [2022-11-19 07:10:09,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:09,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53621142] [2022-11-19 07:10:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:09,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:09,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:09,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53621142] [2022-11-19 07:10:09,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53621142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:09,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:09,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:09,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464778336] [2022-11-19 07:10:09,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:09,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:10:09,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:09,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:10:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:10:09,901 INFO L87 Difference]: Start difference. First operand 490 states and 1480 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-19 07:10:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:10,021 INFO L93 Difference]: Finished difference Result 454 states and 1202 transitions. [2022-11-19 07:10:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:10,022 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-19 07:10:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:10,024 INFO L225 Difference]: With dead ends: 454 [2022-11-19 07:10:10,024 INFO L226 Difference]: Without dead ends: 334 [2022-11-19 07:10:10,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:10,025 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:10,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 10 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:10,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-19 07:10:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-11-19 07:10:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 2.5705705705705704) internal successors, (856), 333 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 856 transitions. [2022-11-19 07:10:10,036 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 856 transitions. Word has length 11 [2022-11-19 07:10:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:10,036 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 856 transitions. [2022-11-19 07:10:10,036 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-19 07:10:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 856 transitions. [2022-11-19 07:10:10,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:10:10,037 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:10,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:10,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:10:10,038 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:10,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:10,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1991223217, now seen corresponding path program 1 times [2022-11-19 07:10:10,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:10,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154929110] [2022-11-19 07:10:10,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:10,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:10,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154929110] [2022-11-19 07:10:10,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154929110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:10,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:10,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:10:10,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020878708] [2022-11-19 07:10:10,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:10,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:10,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:10,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:10,295 INFO L87 Difference]: Start difference. First operand 334 states and 856 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:10,459 INFO L93 Difference]: Finished difference Result 267 states and 628 transitions. [2022-11-19 07:10:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:10:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-19 07:10:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:10,461 INFO L225 Difference]: With dead ends: 267 [2022-11-19 07:10:10,461 INFO L226 Difference]: Without dead ends: 207 [2022-11-19 07:10:10,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:10:10,462 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:10,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 14 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-19 07:10:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-11-19 07:10:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.3058252427184467) internal successors, (475), 206 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 475 transitions. [2022-11-19 07:10:10,469 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 475 transitions. Word has length 14 [2022-11-19 07:10:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:10,470 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 475 transitions. [2022-11-19 07:10:10,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 475 transitions. [2022-11-19 07:10:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:10:10,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:10,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:10,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:10:10,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -926412716, now seen corresponding path program 1 times [2022-11-19 07:10:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:10,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706063436] [2022-11-19 07:10:10,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:10,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:10,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706063436] [2022-11-19 07:10:10,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706063436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:10,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:10,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:10,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990517619] [2022-11-19 07:10:10,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:10,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:10:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:10,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:10:10,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:10:10,713 INFO L87 Difference]: Start difference. First operand 207 states and 475 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:10,816 INFO L93 Difference]: Finished difference Result 273 states and 607 transitions. [2022-11-19 07:10:10,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:10:10,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 07:10:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:10,818 INFO L225 Difference]: With dead ends: 273 [2022-11-19 07:10:10,818 INFO L226 Difference]: Without dead ends: 210 [2022-11-19 07:10:10,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:10,819 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:10,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-19 07:10:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2022-11-19 07:10:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.2233009708737863) internal successors, (458), 206 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 458 transitions. [2022-11-19 07:10:10,825 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 458 transitions. Word has length 17 [2022-11-19 07:10:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:10,825 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 458 transitions. [2022-11-19 07:10:10,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 458 transitions. [2022-11-19 07:10:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:10:10,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:10,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:10,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:10:10,827 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:10,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2125405780, now seen corresponding path program 2 times [2022-11-19 07:10:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:10,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624920602] [2022-11-19 07:10:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:10,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:11,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:11,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624920602] [2022-11-19 07:10:11,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624920602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:11,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:11,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:10:11,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955127596] [2022-11-19 07:10:11,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:11,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:10:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:11,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:10:11,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:10:11,045 INFO L87 Difference]: Start difference. First operand 207 states and 458 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:11,217 INFO L93 Difference]: Finished difference Result 186 states and 415 transitions. [2022-11-19 07:10:11,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:10:11,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 07:10:11,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:11,219 INFO L225 Difference]: With dead ends: 186 [2022-11-19 07:10:11,219 INFO L226 Difference]: Without dead ends: 92 [2022-11-19 07:10:11,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:10:11,220 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:11,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 10 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:10:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-19 07:10:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-19 07:10:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 2.032967032967033) internal successors, (185), 91 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2022-11-19 07:10:11,224 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 17 [2022-11-19 07:10:11,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:11,225 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2022-11-19 07:10:11,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2022-11-19 07:10:11,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:10:11,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:11,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:11,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:10:11,230 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash -580683090, now seen corresponding path program 1 times [2022-11-19 07:10:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:11,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122127950] [2022-11-19 07:10:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:11,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:11,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122127950] [2022-11-19 07:10:11,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122127950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:11,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:11,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:10:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367599598] [2022-11-19 07:10:11,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:11,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:10:11,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:11,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:10:11,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:10:11,850 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:12,058 INFO L93 Difference]: Finished difference Result 148 states and 287 transitions. [2022-11-19 07:10:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:10:12,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-19 07:10:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:12,059 INFO L225 Difference]: With dead ends: 148 [2022-11-19 07:10:12,060 INFO L226 Difference]: Without dead ends: 117 [2022-11-19 07:10:12,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:10:12,060 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:12,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 14 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:10:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-19 07:10:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2022-11-19 07:10:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.01010101010101) internal successors, (199), 99 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 199 transitions. [2022-11-19 07:10:12,064 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 199 transitions. Word has length 21 [2022-11-19 07:10:12,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:12,065 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 199 transitions. [2022-11-19 07:10:12,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 199 transitions. [2022-11-19 07:10:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:10:12,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:12,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:12,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:10:12,066 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:12,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1634877102, now seen corresponding path program 2 times [2022-11-19 07:10:12,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:12,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142815173] [2022-11-19 07:10:12,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:12,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:12,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:13,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:10:13,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142815173] [2022-11-19 07:10:13,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142815173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:13,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:13,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:10:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908812311] [2022-11-19 07:10:13,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:13,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:10:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:10:13,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:10:13,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:10:13,255 INFO L87 Difference]: Start difference. First operand 100 states and 199 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:13,472 INFO L93 Difference]: Finished difference Result 110 states and 213 transitions. [2022-11-19 07:10:13,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:10:13,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-19 07:10:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:13,474 INFO L225 Difference]: With dead ends: 110 [2022-11-19 07:10:13,474 INFO L226 Difference]: Without dead ends: 78 [2022-11-19 07:10:13,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:10:13,475 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:13,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 19 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:10:13,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-19 07:10:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2022-11-19 07:10:13,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.9275362318840579) internal successors, (133), 69 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions. [2022-11-19 07:10:13,479 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 21 [2022-11-19 07:10:13,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:13,479 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 133 transitions. [2022-11-19 07:10:13,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:13,479 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2022-11-19 07:10:13,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:10:13,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:13,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] [2022-11-19 07:10:13,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:10:13,481 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1229845076, now seen corresponding path program 3 times [2022-11-19 07:10:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:10:13,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216649001] [2022-11-19 07:10:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:10:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:10:13,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:10:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:10:13,630 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:10:13,630 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:10:13,632 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-19 07:10:13,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-19 07:10:13,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-19 07:10:13,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-19 07:10:13,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-19 07:10:13,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-19 07:10:13,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-19 07:10:13,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-19 07:10:13,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-19 07:10:13,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-19 07:10:13,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-19 07:10:13,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-19 07:10:13,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-19 07:10:13,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:10:13,639 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:13,645 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:10:13,646 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:10:13,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:10:13 BasicIcfg [2022-11-19 07:10:13,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:10:13,753 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:10:13,753 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:10:13,753 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:10:13,754 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:10:00" (3/4) ... [2022-11-19 07:10:13,756 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:10:13,756 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:10:13,757 INFO L158 Benchmark]: Toolchain (without parser) took 14901.84ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 79.0MB in the beginning and 192.1MB in the end (delta: -113.2MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2022-11-19 07:10:13,757 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:10:13,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.96ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 78.5MB in the end (delta: 350.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 07:10:13,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.44ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:10:13,758 INFO L158 Benchmark]: Boogie Preprocessor took 65.35ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 74.3MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:10:13,762 INFO L158 Benchmark]: RCFGBuilder took 863.99ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 86.4MB in the end (delta: -12.1MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2022-11-19 07:10:13,763 INFO L158 Benchmark]: TraceAbstraction took 13095.78ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 85.8MB in the beginning and 193.2MB in the end (delta: -107.4MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2022-11-19 07:10:13,764 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 268.4MB. Free memory is still 192.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:10:13,766 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.28ms. Allocated memory is still 117.4MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.96ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 78.5MB in the end (delta: 350.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.44ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 76.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 65.35ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 74.3MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 863.99ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 86.4MB in the end (delta: -12.1MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13095.78ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 85.8MB in the beginning and 193.2MB in the end (delta: -107.4MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 268.4MB. Free memory is still 192.1MB. 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.4s, 137 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 33 TransitionsAfterwards, 2364 CoEnabledTransitionPairs, 6 FixpointIterations, 57 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 131 TotalNumberOfCompositions, 5667 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2945, independent: 2783, independent conditional: 0, independent unconditional: 2783, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1720, independent: 1649, independent conditional: 0, independent unconditional: 1649, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1720, independent: 1640, independent conditional: 0, independent unconditional: 1640, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 543, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 526, dependent conditional: 0, dependent unconditional: 526, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2945, independent: 1134, independent conditional: 0, independent unconditional: 1134, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 1720, unknown conditional: 0, unknown unconditional: 1720] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 158, Positive conditional cache size: 0, Positive unconditional cache size: 158, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L718] 0 int __unbuffered_p2_EBX = 0; [L725] 0 _Bool x$flush_delayed; [L736] 0 int *x$read_delayed_var; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L726] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L730] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff0_thd1; [L714] 0 int __unbuffered_p1_EAX = 0; [L729] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd0; [L720] 0 int a = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L735] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L722] 0 _Bool main$tmp_guard1; [L740] 0 _Bool x$w_buff1_used; [L721] 0 _Bool main$tmp_guard0; [L738] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff0; [L739] 0 int x$w_buff1; [L724] 0 int x = 0; [L732] 0 _Bool x$r_buff1_thd1; [L731] 0 _Bool x$r_buff1_thd0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L734] 0 _Bool x$r_buff1_thd3; [L733] 0 _Bool x$r_buff1_thd2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=-2, t916={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=-1, t916={5:0}, t917={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 z = 1 [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: 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: 846]: 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: 844]: 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 7 procedures, 157 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 917 IncrementalHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 35 mSDtfsCounter, 917 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=884occurred in iteration=0, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 140 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 1091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-19 07:10:13,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS --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 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:10:16,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:10:16,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:10:16,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:10:16,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:10:16,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:10:16,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:10:16,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:10:16,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:10:16,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:10:16,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:10:16,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:10:16,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:10:16,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:10:16,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:10:16,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:10:16,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:10:16,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:10:16,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:10:16,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:10:16,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:10:16,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:10:16,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:10:16,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:10:16,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:10:16,248 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:10:16,248 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:10:16,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:10:16,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:10:16,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:10:16,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:10:16,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:10:16,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:10:16,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:10:16,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:10:16,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:10:16,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:10:16,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:10:16,259 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:10:16,260 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:10:16,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:10:16,262 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 07:10:16,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:10:16,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:10:16,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:10:16,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:10:16,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:10:16,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:10:16,312 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:10:16,312 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:10:16,312 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:10:16,313 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:10:16,313 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:10:16,313 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:10:16,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:10:16,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:10:16,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:10:16,315 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:10:16,316 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:10:16,316 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:10:16,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:10:16,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:10:16,317 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:10:16,317 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:10:16,317 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:10:16,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:10:16,318 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:10:16,318 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 07:10:16,319 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 07:10:16,319 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:10:16,319 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:10:16,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:10:16,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 07:10:16,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:10:16,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:10:16,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:10:16,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:10:16,321 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 07:10:16,322 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 07:10:16,322 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:10:16,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 07:10:16,323 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_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 [2022-11-19 07:10:16,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:10:16,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:10:16,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:10:16,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:10:16,704 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:10:16,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-19 07:10:16,784 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/data/cc9f9fb02/5fdf72134196497c9324fc0f32065712/FLAGfbfc0a992 [2022-11-19 07:10:17,472 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:10:17,472 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2022-11-19 07:10:17,500 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/data/cc9f9fb02/5fdf72134196497c9324fc0f32065712/FLAGfbfc0a992 [2022-11-19 07:10:17,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/data/cc9f9fb02/5fdf72134196497c9324fc0f32065712 [2022-11-19 07:10:17,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:10:17,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:10:17,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:10:17,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:10:17,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:10:17,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:10:17" (1/1) ... [2022-11-19 07:10:17,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c769c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:17, skipping insertion in model container [2022-11-19 07:10:17,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:10:17" (1/1) ... [2022-11-19 07:10:17,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:10:17,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:10:18,025 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-19 07:10:18,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:10:18,287 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:10:18,304 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i[1001,1014] [2022-11-19 07:10:18,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:10:18,440 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:10:18,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18 WrapperNode [2022-11-19 07:10:18,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:10:18,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:10:18,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:10:18,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:10:18,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,481 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,528 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-11-19 07:10:18,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:10:18,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:10:18,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:10:18,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:10:18,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,559 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,571 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:10:18,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:10:18,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:10:18,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:10:18,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (1/1) ... [2022-11-19 07:10:18,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:10:18,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:10:18,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:10:18,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:10:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:10:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:10:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:10:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:10:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 07:10:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 07:10:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:10:18,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:10:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:10:18,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:10:18,692 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:10:18,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:10:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:10:18,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:10:18,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:10:18,695 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:10:18,921 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:10:18,922 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:10:19,416 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:10:19,573 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:10:19,578 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:10:19,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:10:19 BoogieIcfgContainer [2022-11-19 07:10:19,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:10:19,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:10:19,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:10:19,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:10:19,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:10:17" (1/3) ... [2022-11-19 07:10:19,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37994ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:10:19, skipping insertion in model container [2022-11-19 07:10:19,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:10:18" (2/3) ... [2022-11-19 07:10:19,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37994ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:10:19, skipping insertion in model container [2022-11-19 07:10:19,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:10:19" (3/3) ... [2022-11-19 07:10:19,592 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2022-11-19 07:10:19,611 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:10:19,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-19 07:10:19,611 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:10:19,690 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:10:19,732 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:10:19,749 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-19 07:10:19,752 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-19 07:10:19,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-19 07:10:19,842 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-19 07:10:19,842 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:10:19,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-11-19 07:10:19,853 INFO L119 LiptonReduction]: Number of co-enabled transitions 2364 [2022-11-19 07:10:29,664 INFO L134 LiptonReduction]: Checked pairs total: 5900 [2022-11-19 07:10:29,666 INFO L136 LiptonReduction]: Total number of compositions: 127 [2022-11-19 07:10:29,674 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 35 transitions, 85 flow [2022-11-19 07:10:29,770 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1028 states, 1015 states have (on average 3.3300492610837438) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:29,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:10:29,793 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;@4a962388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:10:29,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-19 07:10:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 1028 states, 1015 states have (on average 3.3300492610837438) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:10:29,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:29,804 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:10:29,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:29,810 INFO L85 PathProgramCache]: Analyzing trace with hash 547, now seen corresponding path program 1 times [2022-11-19 07:10:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:29,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108207355] [2022-11-19 07:10:29,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:29,823 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-19 07:10:29,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:29,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:29,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:29,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 07:10:29,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:29,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:29,927 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:29,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108207355] [2022-11-19 07:10:29,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108207355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:29,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:29,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:10:29,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494596357] [2022-11-19 07:10:29,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:29,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:10:29,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:29,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:10:29,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:10:29,968 INFO L87 Difference]: Start difference. First operand has 1028 states, 1015 states have (on average 3.3300492610837438) internal successors, (3380), 1027 states have internal predecessors, (3380), 0 states have call successors, (0), 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-19 07:10:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:30,141 INFO L93 Difference]: Finished difference Result 970 states and 3096 transitions. [2022-11-19 07:10:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:10:30,144 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-19 07:10:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:30,199 INFO L225 Difference]: With dead ends: 970 [2022-11-19 07:10:30,208 INFO L226 Difference]: Without dead ends: 970 [2022-11-19 07:10:30,209 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-19 07:10:30,213 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:30,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-11-19 07:10:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-11-19 07:10:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 965 states have (on average 3.2082901554404146) internal successors, (3096), 969 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3096 transitions. [2022-11-19 07:10:30,432 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3096 transitions. Word has length 1 [2022-11-19 07:10:30,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:30,433 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 3096 transitions. [2022-11-19 07:10:30,433 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-19 07:10:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3096 transitions. [2022-11-19 07:10:30,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 07:10:30,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:30,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 07:10:30,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:30,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:30,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:30,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:30,644 INFO L85 PathProgramCache]: Analyzing trace with hash 516278886, now seen corresponding path program 1 times [2022-11-19 07:10:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:30,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306981914] [2022-11-19 07:10:30,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:30,645 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-19 07:10:30,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:30,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:30,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:30,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:10:30,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:30,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:30,796 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:30,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306981914] [2022-11-19 07:10:30,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306981914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:30,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:30,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:10:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139832445] [2022-11-19 07:10:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:30,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:10:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:10:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:10:30,799 INFO L87 Difference]: Start difference. First operand 970 states and 3096 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:30,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:30,926 INFO L93 Difference]: Finished difference Result 794 states and 2496 transitions. [2022-11-19 07:10:30,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:10:30,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-19 07:10:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:30,937 INFO L225 Difference]: With dead ends: 794 [2022-11-19 07:10:30,938 INFO L226 Difference]: Without dead ends: 770 [2022-11-19 07:10:30,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:10:30,940 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:30,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-11-19 07:10:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-11-19 07:10:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 768 states have (on average 3.1692708333333335) internal successors, (2434), 769 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2434 transitions. [2022-11-19 07:10:30,986 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2434 transitions. Word has length 5 [2022-11-19 07:10:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:30,986 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 2434 transitions. [2022-11-19 07:10:30,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2434 transitions. [2022-11-19 07:10:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-19 07:10:30,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:30,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:31,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:31,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:31,201 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:31,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1125617351, now seen corresponding path program 1 times [2022-11-19 07:10:31,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:31,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701490413] [2022-11-19 07:10:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:31,203 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-19 07:10:31,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:31,204 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:31,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:31,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:10:31,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:31,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:31,366 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:31,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701490413] [2022-11-19 07:10:31,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701490413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:31,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:31,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:31,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136788065] [2022-11-19 07:10:31,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:31,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:10:31,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:31,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:10:31,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:10:31,369 INFO L87 Difference]: Start difference. First operand 770 states and 2434 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:31,516 INFO L93 Difference]: Finished difference Result 590 states and 1580 transitions. [2022-11-19 07:10:31,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:10:31,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-19 07:10:31,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:31,520 INFO L225 Difference]: With dead ends: 590 [2022-11-19 07:10:31,520 INFO L226 Difference]: Without dead ends: 470 [2022-11-19 07:10:31,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:31,521 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:31,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 9 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:10:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-11-19 07:10:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2022-11-19 07:10:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 468 states have (on average 2.6367521367521367) internal successors, (1234), 469 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1234 transitions. [2022-11-19 07:10:31,539 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1234 transitions. Word has length 10 [2022-11-19 07:10:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:31,539 INFO L495 AbstractCegarLoop]: Abstraction has 470 states and 1234 transitions. [2022-11-19 07:10:31,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:31,540 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1234 transitions. [2022-11-19 07:10:31,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:10:31,542 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:31,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:31,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:31,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:31,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:31,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash 184258381, now seen corresponding path program 1 times [2022-11-19 07:10:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:31,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054418610] [2022-11-19 07:10:31,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:31,758 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-19 07:10:31,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:31,759 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:31,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:31,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:10:31,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:32,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:32,003 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:32,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054418610] [2022-11-19 07:10:32,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054418610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:32,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:32,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:10:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977745508] [2022-11-19 07:10:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:32,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:32,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:32,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:32,007 INFO L87 Difference]: Start difference. First operand 470 states and 1234 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:32,185 INFO L93 Difference]: Finished difference Result 295 states and 682 transitions. [2022-11-19 07:10:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:32,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:10:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:32,188 INFO L225 Difference]: With dead ends: 295 [2022-11-19 07:10:32,188 INFO L226 Difference]: Without dead ends: 235 [2022-11-19 07:10:32,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:10:32,189 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 68 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:32,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 15 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:10:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-19 07:10:32,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-11-19 07:10:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 233 states have (on average 2.2703862660944205) internal successors, (529), 234 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 529 transitions. [2022-11-19 07:10:32,197 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 529 transitions. Word has length 13 [2022-11-19 07:10:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:32,198 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 529 transitions. [2022-11-19 07:10:32,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:32,198 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 529 transitions. [2022-11-19 07:10:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:10:32,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:32,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:10:32,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:32,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:32,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:32,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1121494607, now seen corresponding path program 1 times [2022-11-19 07:10:32,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:32,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248181743] [2022-11-19 07:10:32,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:32,413 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-19 07:10:32,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:32,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:32,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:32,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:10:32,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:32,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:32,620 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:32,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248181743] [2022-11-19 07:10:32,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248181743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:32,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:32,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:10:32,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34477441] [2022-11-19 07:10:32,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:32,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:10:32,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:32,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:10:32,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:10:32,622 INFO L87 Difference]: Start difference. First operand 235 states and 529 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:32,860 INFO L93 Difference]: Finished difference Result 188 states and 433 transitions. [2022-11-19 07:10:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:10:32,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-19 07:10:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:32,862 INFO L225 Difference]: With dead ends: 188 [2022-11-19 07:10:32,862 INFO L226 Difference]: Without dead ends: 175 [2022-11-19 07:10:32,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:10:32,863 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:32,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 27 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:10:32,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-19 07:10:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-11-19 07:10:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 2.3641618497109826) internal successors, (409), 174 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 409 transitions. [2022-11-19 07:10:32,869 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 409 transitions. Word has length 17 [2022-11-19 07:10:32,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:32,869 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 409 transitions. [2022-11-19 07:10:32,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 409 transitions. [2022-11-19 07:10:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:32,871 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:32,871 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-19 07:10:32,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:33,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:33,084 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:33,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1314944809, now seen corresponding path program 1 times [2022-11-19 07:10:33,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:33,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825002822] [2022-11-19 07:10:33,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:33,085 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-19 07:10:33,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:33,086 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:33,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:33,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:33,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:33,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:33,758 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:33,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825002822] [2022-11-19 07:10:33,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825002822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:33,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:33,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:33,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128004273] [2022-11-19 07:10:33,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:33,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:33,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:33,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:33,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:33,760 INFO L87 Difference]: Start difference. First operand 175 states and 409 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:33,869 INFO L93 Difference]: Finished difference Result 311 states and 730 transitions. [2022-11-19 07:10:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:33,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:33,872 INFO L225 Difference]: With dead ends: 311 [2022-11-19 07:10:33,872 INFO L226 Difference]: Without dead ends: 311 [2022-11-19 07:10:33,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:33,873 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:33,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-11-19 07:10:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-19 07:10:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 185. [2022-11-19 07:10:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 183 states have (on average 2.289617486338798) internal successors, (419), 184 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 419 transitions. [2022-11-19 07:10:33,881 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 419 transitions. Word has length 22 [2022-11-19 07:10:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:33,882 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 419 transitions. [2022-11-19 07:10:33,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 419 transitions. [2022-11-19 07:10:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:33,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:33,883 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-19 07:10:33,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:34,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:34,107 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1314944790, now seen corresponding path program 1 times [2022-11-19 07:10:34,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:34,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21965838] [2022-11-19 07:10:34,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:10:34,109 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-19 07:10:34,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:34,110 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:34,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:34,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-19 07:10:34,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:34,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:34,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:34,415 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:34,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21965838] [2022-11-19 07:10:34,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21965838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:34,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:34,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:10:34,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263902296] [2022-11-19 07:10:34,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:34,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:10:34,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:34,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:10:34,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:10:34,418 INFO L87 Difference]: Start difference. First operand 185 states and 419 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) 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-19 07:10:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:34,729 INFO L93 Difference]: Finished difference Result 273 states and 572 transitions. [2022-11-19 07:10:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:10:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) 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-19 07:10:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:34,731 INFO L225 Difference]: With dead ends: 273 [2022-11-19 07:10:34,731 INFO L226 Difference]: Without dead ends: 262 [2022-11-19 07:10:34,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:10:34,732 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:34,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 37 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:10:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-11-19 07:10:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 235. [2022-11-19 07:10:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 233 states have (on average 2.2145922746781115) internal successors, (516), 234 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 516 transitions. [2022-11-19 07:10:34,740 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 516 transitions. Word has length 22 [2022-11-19 07:10:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:34,740 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 516 transitions. [2022-11-19 07:10:34,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) 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-19 07:10:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 516 transitions. [2022-11-19 07:10:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:34,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:34,742 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-19 07:10:34,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:34,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:34,960 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:34,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1322036617, now seen corresponding path program 2 times [2022-11-19 07:10:34,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:34,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607885193] [2022-11-19 07:10:34,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:10:34,961 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-19 07:10:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:34,963 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:34,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:35,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:10:35,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:35,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:35,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:35,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:35,482 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:35,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607885193] [2022-11-19 07:10:35,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607885193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:35,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:35,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700741979] [2022-11-19 07:10:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:35,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:35,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:35,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:35,483 INFO L87 Difference]: Start difference. First operand 235 states and 516 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:35,588 INFO L93 Difference]: Finished difference Result 402 states and 892 transitions. [2022-11-19 07:10:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:35,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:35,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:35,591 INFO L225 Difference]: With dead ends: 402 [2022-11-19 07:10:35,592 INFO L226 Difference]: Without dead ends: 384 [2022-11-19 07:10:35,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:35,593 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:35,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 35 Unchecked, 0.1s Time] [2022-11-19 07:10:35,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-19 07:10:35,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 241. [2022-11-19 07:10:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 239 states have (on average 2.200836820083682) internal successors, (526), 240 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 526 transitions. [2022-11-19 07:10:35,604 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 526 transitions. Word has length 22 [2022-11-19 07:10:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:35,605 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 526 transitions. [2022-11-19 07:10:35,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 526 transitions. [2022-11-19 07:10:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:35,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:35,607 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-19 07:10:35,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:35,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:35,820 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:35,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:35,820 INFO L85 PathProgramCache]: Analyzing trace with hash -583635465, now seen corresponding path program 3 times [2022-11-19 07:10:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:35,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182646280] [2022-11-19 07:10:35,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:10:35,821 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-19 07:10:35,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:35,822 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:35,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:36,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:10:36,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:36,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:36,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:36,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:36,348 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:36,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182646280] [2022-11-19 07:10:36,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182646280] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:36,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:36,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:36,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604053729] [2022-11-19 07:10:36,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:36,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:36,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:36,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:36,349 INFO L87 Difference]: Start difference. First operand 241 states and 526 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:36,425 INFO L93 Difference]: Finished difference Result 398 states and 887 transitions. [2022-11-19 07:10:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:36,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:36,428 INFO L225 Difference]: With dead ends: 398 [2022-11-19 07:10:36,428 INFO L226 Difference]: Without dead ends: 381 [2022-11-19 07:10:36,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:36,429 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:36,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-19 07:10:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-19 07:10:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 248. [2022-11-19 07:10:36,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 246 states have (on average 2.1707317073170733) internal successors, (534), 247 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 534 transitions. [2022-11-19 07:10:36,438 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 534 transitions. Word has length 22 [2022-11-19 07:10:36,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:36,439 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 534 transitions. [2022-11-19 07:10:36,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:36,439 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 534 transitions. [2022-11-19 07:10:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:36,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:36,440 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-19 07:10:36,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:36,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:36,653 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1980106076, now seen corresponding path program 2 times [2022-11-19 07:10:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:36,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466410659] [2022-11-19 07:10:36,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:10:36,654 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-19 07:10:36,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:36,655 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:36,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:36,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:10:36,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:36,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:10:36,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:36,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:36,857 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:36,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466410659] [2022-11-19 07:10:36,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466410659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:36,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:36,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:10:36,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258726648] [2022-11-19 07:10:36,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:36,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:36,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:36,859 INFO L87 Difference]: Start difference. First operand 248 states and 534 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-19 07:10:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:37,032 INFO L93 Difference]: Finished difference Result 320 states and 675 transitions. [2022-11-19 07:10:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:37,033 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-19 07:10:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:37,034 INFO L225 Difference]: With dead ends: 320 [2022-11-19 07:10:37,035 INFO L226 Difference]: Without dead ends: 293 [2022-11-19 07:10:37,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:10:37,035 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:37,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 18 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:10:37,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-19 07:10:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 232. [2022-11-19 07:10:37,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 230 states have (on average 2.2956521739130435) internal successors, (528), 231 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 528 transitions. [2022-11-19 07:10:37,043 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 528 transitions. Word has length 22 [2022-11-19 07:10:37,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:37,043 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 528 transitions. [2022-11-19 07:10:37,044 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-19 07:10:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 528 transitions. [2022-11-19 07:10:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:37,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:37,045 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-19 07:10:37,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:37,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:37,257 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:37,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash -649530867, now seen corresponding path program 4 times [2022-11-19 07:10:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:37,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080761899] [2022-11-19 07:10:37,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:10:37,258 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-19 07:10:37,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:37,260 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:37,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:37,455 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:10:37,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:37,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:37,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:37,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:37,756 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:37,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080761899] [2022-11-19 07:10:37,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080761899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:37,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:37,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:37,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462101219] [2022-11-19 07:10:37,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:37,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:37,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:37,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:37,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:37,757 INFO L87 Difference]: Start difference. First operand 232 states and 528 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:37,833 INFO L93 Difference]: Finished difference Result 368 states and 848 transitions. [2022-11-19 07:10:37,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:37,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:37,835 INFO L225 Difference]: With dead ends: 368 [2022-11-19 07:10:37,835 INFO L226 Difference]: Without dead ends: 350 [2022-11-19 07:10:37,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:37,836 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:37,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-11-19 07:10:37,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-19 07:10:37,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 231. [2022-11-19 07:10:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 229 states have (on average 2.2925764192139737) internal successors, (525), 230 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:37,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 525 transitions. [2022-11-19 07:10:37,844 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 525 transitions. Word has length 22 [2022-11-19 07:10:37,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:37,844 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 525 transitions. [2022-11-19 07:10:37,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:37,845 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 525 transitions. [2022-11-19 07:10:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:37,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:37,846 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-19 07:10:37,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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)] Ended with exit code 0 [2022-11-19 07:10:38,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:38,058 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:38,058 INFO L85 PathProgramCache]: Analyzing trace with hash -791576449, now seen corresponding path program 5 times [2022-11-19 07:10:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:38,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016169481] [2022-11-19 07:10:38,059 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-19 07:10:38,059 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-19 07:10:38,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:38,063 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:38,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (13)] Waiting until timeout for monitored process [2022-11-19 07:10:38,235 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:10:38,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:38,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:38,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:38,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:38,547 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:38,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016169481] [2022-11-19 07:10:38,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016169481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:38,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:38,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:38,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832780054] [2022-11-19 07:10:38,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:38,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:38,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:38,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:38,548 INFO L87 Difference]: Start difference. First operand 231 states and 525 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:38,623 INFO L93 Difference]: Finished difference Result 367 states and 845 transitions. [2022-11-19 07:10:38,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:38,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:38,631 INFO L225 Difference]: With dead ends: 367 [2022-11-19 07:10:38,632 INFO L226 Difference]: Without dead ends: 335 [2022-11-19 07:10:38,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:38,632 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:38,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-19 07:10:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-19 07:10:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 230. [2022-11-19 07:10:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 228 states have (on average 2.289473684210526) internal successors, (522), 229 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 522 transitions. [2022-11-19 07:10:38,641 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 522 transitions. Word has length 22 [2022-11-19 07:10:38,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:38,642 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 522 transitions. [2022-11-19 07:10:38,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 522 transitions. [2022-11-19 07:10:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:38,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:38,645 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-19 07:10:38,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (13)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:38,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:38,857 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1826199629, now seen corresponding path program 6 times [2022-11-19 07:10:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:38,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226862176] [2022-11-19 07:10:38,858 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-19 07:10:38,859 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-19 07:10:38,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:38,860 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:38,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (14)] Waiting until timeout for monitored process [2022-11-19 07:10:39,052 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-19 07:10:39,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:39,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:39,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:39,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:39,353 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:39,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226862176] [2022-11-19 07:10:39,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226862176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:39,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:39,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940534037] [2022-11-19 07:10:39,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:39,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:39,355 INFO L87 Difference]: Start difference. First operand 230 states and 522 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:39,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:39,464 INFO L93 Difference]: Finished difference Result 366 states and 842 transitions. [2022-11-19 07:10:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:39,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:39,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:39,466 INFO L225 Difference]: With dead ends: 366 [2022-11-19 07:10:39,467 INFO L226 Difference]: Without dead ends: 320 [2022-11-19 07:10:39,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:39,467 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:39,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-11-19 07:10:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-19 07:10:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 229. [2022-11-19 07:10:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 227 states have (on average 2.2863436123348015) internal successors, (519), 228 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 519 transitions. [2022-11-19 07:10:39,475 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 519 transitions. Word has length 22 [2022-11-19 07:10:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:39,476 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 519 transitions. [2022-11-19 07:10:39,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 519 transitions. [2022-11-19 07:10:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:39,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:39,477 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-19 07:10:39,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (14)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:39,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:39,690 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:39,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:39,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1686350639, now seen corresponding path program 7 times [2022-11-19 07:10:39,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:39,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728021652] [2022-11-19 07:10:39,692 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:10:39,692 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-19 07:10:39,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:39,693 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:39,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (15)] Waiting until timeout for monitored process [2022-11-19 07:10:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:39,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:39,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:40,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:40,197 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:40,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728021652] [2022-11-19 07:10:40,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728021652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:40,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:40,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:40,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323375264] [2022-11-19 07:10:40,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:40,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:40,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:40,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:40,199 INFO L87 Difference]: Start difference. First operand 229 states and 519 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:40,293 INFO L93 Difference]: Finished difference Result 365 states and 839 transitions. [2022-11-19 07:10:40,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:40,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:40,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:40,299 INFO L225 Difference]: With dead ends: 365 [2022-11-19 07:10:40,299 INFO L226 Difference]: Without dead ends: 332 [2022-11-19 07:10:40,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:40,301 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:40,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-11-19 07:10:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-11-19 07:10:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 227. [2022-11-19 07:10:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 225 states have (on average 2.28) internal successors, (513), 226 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 513 transitions. [2022-11-19 07:10:40,310 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 513 transitions. Word has length 22 [2022-11-19 07:10:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:40,311 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 513 transitions. [2022-11-19 07:10:40,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 513 transitions. [2022-11-19 07:10:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:40,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:40,313 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-19 07:10:40,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (15)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:40,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:40,525 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1577904893, now seen corresponding path program 8 times [2022-11-19 07:10:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:40,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432751991] [2022-11-19 07:10:40,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:10:40,526 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-19 07:10:40,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:40,529 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:40,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (16)] Waiting until timeout for monitored process [2022-11-19 07:10:40,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:10:40,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:40,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:40,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:40,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:40,999 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:40,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432751991] [2022-11-19 07:10:41,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432751991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:41,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:41,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:41,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119452465] [2022-11-19 07:10:41,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:41,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:41,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:41,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:41,001 INFO L87 Difference]: Start difference. First operand 227 states and 513 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:41,085 INFO L93 Difference]: Finished difference Result 363 states and 833 transitions. [2022-11-19 07:10:41,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:41,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:41,087 INFO L225 Difference]: With dead ends: 363 [2022-11-19 07:10:41,087 INFO L226 Difference]: Without dead ends: 302 [2022-11-19 07:10:41,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:41,088 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:41,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-11-19 07:10:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-19 07:10:41,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 225. [2022-11-19 07:10:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 223 states have (on average 2.273542600896861) internal successors, (507), 224 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 507 transitions. [2022-11-19 07:10:41,095 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 507 transitions. Word has length 22 [2022-11-19 07:10:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:41,096 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 507 transitions. [2022-11-19 07:10:41,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:41,096 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 507 transitions. [2022-11-19 07:10:41,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:41,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:41,097 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-19 07:10:41,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (16)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:41,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:41,309 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:41,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1413684163, now seen corresponding path program 9 times [2022-11-19 07:10:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:41,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268152986] [2022-11-19 07:10:41,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:10:41,310 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-19 07:10:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:41,311 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:41,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (17)] Waiting until timeout for monitored process [2022-11-19 07:10:41,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:10:41,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:41,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:41,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:41,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:41,790 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:41,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268152986] [2022-11-19 07:10:41,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268152986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:41,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:41,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:41,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925731210] [2022-11-19 07:10:41,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:41,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:41,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:41,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:41,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:41,793 INFO L87 Difference]: Start difference. First operand 225 states and 507 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:41,868 INFO L93 Difference]: Finished difference Result 361 states and 827 transitions. [2022-11-19 07:10:41,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:41,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:41,870 INFO L225 Difference]: With dead ends: 361 [2022-11-19 07:10:41,870 INFO L226 Difference]: Without dead ends: 272 [2022-11-19 07:10:41,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:41,871 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:41,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-11-19 07:10:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-19 07:10:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 223. [2022-11-19 07:10:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 221 states have (on average 2.266968325791855) internal successors, (501), 222 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 501 transitions. [2022-11-19 07:10:41,879 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 501 transitions. Word has length 22 [2022-11-19 07:10:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:41,879 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 501 transitions. [2022-11-19 07:10:41,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 501 transitions. [2022-11-19 07:10:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:41,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:41,880 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-19 07:10:41,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (17)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:42,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:42,081 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:42,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1648888693, now seen corresponding path program 10 times [2022-11-19 07:10:42,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:42,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221461207] [2022-11-19 07:10:42,082 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:10:42,082 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-19 07:10:42,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:42,083 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:42,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (18)] Waiting until timeout for monitored process [2022-11-19 07:10:42,235 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:10:42,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:42,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:42,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:42,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:42,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:42,540 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:42,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221461207] [2022-11-19 07:10:42,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221461207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:42,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:42,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:42,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198090805] [2022-11-19 07:10:42,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:42,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:42,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:42,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:42,541 INFO L87 Difference]: Start difference. First operand 223 states and 501 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:42,619 INFO L93 Difference]: Finished difference Result 331 states and 748 transitions. [2022-11-19 07:10:42,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:42,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:42,621 INFO L225 Difference]: With dead ends: 331 [2022-11-19 07:10:42,621 INFO L226 Difference]: Without dead ends: 290 [2022-11-19 07:10:42,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:42,622 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:42,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-11-19 07:10:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-19 07:10:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 220. [2022-11-19 07:10:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 218 states have (on average 2.270642201834862) internal successors, (495), 219 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 495 transitions. [2022-11-19 07:10:42,628 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 495 transitions. Word has length 22 [2022-11-19 07:10:42,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:42,629 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 495 transitions. [2022-11-19 07:10:42,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 495 transitions. [2022-11-19 07:10:42,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:42,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:42,629 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-19 07:10:42,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (18)] Ended with exit code 0 [2022-11-19 07:10:42,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:42,842 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:42,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1508931801, now seen corresponding path program 11 times [2022-11-19 07:10:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:42,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738995610] [2022-11-19 07:10:42,842 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-19 07:10:42,843 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-19 07:10:42,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:42,843 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:42,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (19)] Waiting until timeout for monitored process [2022-11-19 07:10:43,000 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:10:43,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:43,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:43,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:43,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:43,348 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:43,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738995610] [2022-11-19 07:10:43,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738995610] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:43,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:43,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:43,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786397898] [2022-11-19 07:10:43,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:43,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:43,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:43,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:43,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:43,350 INFO L87 Difference]: Start difference. First operand 220 states and 495 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:43,441 INFO L93 Difference]: Finished difference Result 328 states and 742 transitions. [2022-11-19 07:10:43,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:43,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:43,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:43,443 INFO L225 Difference]: With dead ends: 328 [2022-11-19 07:10:43,443 INFO L226 Difference]: Without dead ends: 252 [2022-11-19 07:10:43,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:43,444 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:43,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2022-11-19 07:10:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-19 07:10:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 217. [2022-11-19 07:10:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 215 states have (on average 2.2744186046511627) internal successors, (489), 216 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 489 transitions. [2022-11-19 07:10:43,451 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 489 transitions. Word has length 22 [2022-11-19 07:10:43,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:43,452 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 489 transitions. [2022-11-19 07:10:43,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 489 transitions. [2022-11-19 07:10:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:43,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:43,453 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-19 07:10:43,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (19)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:43,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:43,654 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:43,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1210142681, now seen corresponding path program 12 times [2022-11-19 07:10:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:43,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857466411] [2022-11-19 07:10:43,655 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-19 07:10:43,655 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-19 07:10:43,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:43,656 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:43,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (20)] Waiting until timeout for monitored process [2022-11-19 07:10:43,847 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-19 07:10:43,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:43,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:43,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:44,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:44,167 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:44,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857466411] [2022-11-19 07:10:44,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857466411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:44,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:44,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:44,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223385185] [2022-11-19 07:10:44,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:44,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:44,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:44,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:44,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:44,168 INFO L87 Difference]: Start difference. First operand 217 states and 489 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:44,231 INFO L93 Difference]: Finished difference Result 325 states and 736 transitions. [2022-11-19 07:10:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:44,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:44,233 INFO L225 Difference]: With dead ends: 325 [2022-11-19 07:10:44,233 INFO L226 Difference]: Without dead ends: 214 [2022-11-19 07:10:44,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:44,234 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:44,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-11-19 07:10:44,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-19 07:10:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-11-19 07:10:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 212 states have (on average 2.2783018867924527) internal successors, (483), 213 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 483 transitions. [2022-11-19 07:10:44,249 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 483 transitions. Word has length 22 [2022-11-19 07:10:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:44,250 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 483 transitions. [2022-11-19 07:10:44,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 483 transitions. [2022-11-19 07:10:44,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:44,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:44,251 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-19 07:10:44,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (20)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:44,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:44,463 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1947960485, now seen corresponding path program 13 times [2022-11-19 07:10:44,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:44,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602192922] [2022-11-19 07:10:44,464 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 07:10:44,464 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-19 07:10:44,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:44,466 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:44,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (21)] Waiting until timeout for monitored process [2022-11-19 07:10:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:10:44,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:44,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:44,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:44,914 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:44,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602192922] [2022-11-19 07:10:44,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602192922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:44,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:44,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:44,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739804957] [2022-11-19 07:10:44,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:44,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:44,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:44,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:44,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:44,916 INFO L87 Difference]: Start difference. First operand 214 states and 483 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:44,976 INFO L93 Difference]: Finished difference Result 364 states and 821 transitions. [2022-11-19 07:10:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:44,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:44,979 INFO L225 Difference]: With dead ends: 364 [2022-11-19 07:10:44,979 INFO L226 Difference]: Without dead ends: 340 [2022-11-19 07:10:44,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:44,982 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:44,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-11-19 07:10:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-19 07:10:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 231. [2022-11-19 07:10:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 229 states have (on average 2.2008733624454146) internal successors, (504), 230 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 504 transitions. [2022-11-19 07:10:45,007 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 504 transitions. Word has length 22 [2022-11-19 07:10:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:45,008 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 504 transitions. [2022-11-19 07:10:45,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 504 transitions. [2022-11-19 07:10:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:45,009 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:45,009 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-19 07:10:45,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (21)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:45,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:45,223 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1465645046, now seen corresponding path program 3 times [2022-11-19 07:10:45,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:45,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085219948] [2022-11-19 07:10:45,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:10:45,224 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-19 07:10:45,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:45,225 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:45,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (22)] Waiting until timeout for monitored process [2022-11-19 07:10:45,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:10:45,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:45,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:45,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:45,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:45,596 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:45,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2085219948] [2022-11-19 07:10:45,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2085219948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:45,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:45,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:10:45,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641026318] [2022-11-19 07:10:45,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:45,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:10:45,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:45,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:10:45,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:10:45,598 INFO L87 Difference]: Start difference. First operand 231 states and 504 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-19 07:10:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:45,884 INFO L93 Difference]: Finished difference Result 274 states and 575 transitions. [2022-11-19 07:10:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:10:45,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-19 07:10:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:45,886 INFO L225 Difference]: With dead ends: 274 [2022-11-19 07:10:45,886 INFO L226 Difference]: Without dead ends: 256 [2022-11-19 07:10:45,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:10:45,887 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 55 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:45,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 36 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:10:45,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-11-19 07:10:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 195. [2022-11-19 07:10:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 193 states have (on average 2.2797927461139897) internal successors, (440), 194 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 440 transitions. [2022-11-19 07:10:45,894 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 440 transitions. Word has length 22 [2022-11-19 07:10:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:45,894 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 440 transitions. [2022-11-19 07:10:45,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-19 07:10:45,894 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 440 transitions. [2022-11-19 07:10:45,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:45,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:45,909 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-19 07:10:45,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (22)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:46,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:46,110 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:46,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1002925359, now seen corresponding path program 14 times [2022-11-19 07:10:46,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:46,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086939506] [2022-11-19 07:10:46,111 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:10:46,111 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-19 07:10:46,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:46,112 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:46,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (23)] Waiting until timeout for monitored process [2022-11-19 07:10:46,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:10:46,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:46,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:46,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:46,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:46,560 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:46,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086939506] [2022-11-19 07:10:46,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086939506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:46,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:46,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083708445] [2022-11-19 07:10:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:46,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:46,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:46,562 INFO L87 Difference]: Start difference. First operand 195 states and 440 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:46,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:46,617 INFO L93 Difference]: Finished difference Result 328 states and 749 transitions. [2022-11-19 07:10:46,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:46,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:46,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:46,619 INFO L225 Difference]: With dead ends: 328 [2022-11-19 07:10:46,619 INFO L226 Difference]: Without dead ends: 268 [2022-11-19 07:10:46,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:46,620 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:46,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-11-19 07:10:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-11-19 07:10:46,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 194. [2022-11-19 07:10:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 2.28125) internal successors, (438), 193 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 438 transitions. [2022-11-19 07:10:46,628 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 438 transitions. Word has length 22 [2022-11-19 07:10:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:46,628 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 438 transitions. [2022-11-19 07:10:46,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 438 transitions. [2022-11-19 07:10:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:46,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:46,629 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-19 07:10:46,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (23)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:46,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:46,842 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:46,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:46,842 INFO L85 PathProgramCache]: Analyzing trace with hash -383169345, now seen corresponding path program 15 times [2022-11-19 07:10:46,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:46,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780168052] [2022-11-19 07:10:46,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:10:46,843 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-19 07:10:46,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:46,844 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:46,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (24)] Waiting until timeout for monitored process [2022-11-19 07:10:47,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:10:47,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:10:47,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:10:47,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:10:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:10:47,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:10:47,300 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:10:47,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780168052] [2022-11-19 07:10:47,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780168052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:10:47,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:10:47,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:10:47,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150313614] [2022-11-19 07:10:47,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:10:47,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:10:47,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:10:47,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:10:47,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:47,302 INFO L87 Difference]: Start difference. First operand 194 states and 438 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-19 07:10:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:10:47,343 INFO L93 Difference]: Finished difference Result 342 states and 771 transitions. [2022-11-19 07:10:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:10:47,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:10:47,345 INFO L225 Difference]: With dead ends: 342 [2022-11-19 07:10:47,345 INFO L226 Difference]: Without dead ends: 241 [2022-11-19 07:10:47,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:10:47,346 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:10:47,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-11-19 07:10:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-19 07:10:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-19 07:10:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 239 states have (on average 2.200836820083682) internal successors, (526), 240 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:10:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 526 transitions. [2022-11-19 07:10:47,354 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 526 transitions. Word has length 22 [2022-11-19 07:10:47,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:10:47,354 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 526 transitions. [2022-11-19 07:10:47,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-19 07:10:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 526 transitions. [2022-11-19 07:10:47,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:10:47,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:10:47,355 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-19 07:10:47,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (24)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:47,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:47,567 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-19 07:10:47,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:10:47,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1415468342, now seen corresponding path program 4 times [2022-11-19 07:10:47,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:10:47,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060727177] [2022-11-19 07:10:47,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:10:47,569 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-19 07:10:47,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:10:47,570 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:47,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (25)] Waiting until timeout for monitored process [2022-11-19 07:10:47,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:10:47,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-19 07:10:47,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:10:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:10:47,911 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-19 07:10:47,918 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:10:47,919 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-19 07:10:47,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-19 07:10:47,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-19 07:10:47,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-19 07:10:47,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-19 07:10:47,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-19 07:10:47,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-19 07:10:47,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-19 07:10:47,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-19 07:10:47,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-19 07:10:47,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-19 07:10:47,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-19 07:10:47,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-19 07:10:47,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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 (25)] Forceful destruction successful, exit code 0 [2022-11-19 07:10:48,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/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-19 07:10:48,137 INFO L444 BasicCegarLoop]: Path program histogram: [15, 4, 1, 1, 1, 1, 1] [2022-11-19 07:10:48,142 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:10:48,142 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:10:48,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:10:48 BasicIcfg [2022-11-19 07:10:48,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:10:48,213 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:10:48,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:10:48,214 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:10:48,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:10:19" (3/4) ... [2022-11-19 07:10:48,217 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:10:48,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:10:48,218 INFO L158 Benchmark]: Toolchain (without parser) took 30503.77ms. Allocated memory was 69.2MB in the beginning and 157.3MB in the end (delta: 88.1MB). Free memory was 48.6MB in the beginning and 117.7MB in the end (delta: -69.1MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2022-11-19 07:10:48,218 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 69.2MB. Free memory was 50.6MB in the beginning and 50.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:10:48,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 722.95ms. Allocated memory is still 69.2MB. Free memory was 48.4MB in the beginning and 39.8MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 07:10:48,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.99ms. Allocated memory is still 69.2MB. Free memory was 39.8MB in the beginning and 37.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:10:48,219 INFO L158 Benchmark]: Boogie Preprocessor took 62.24ms. Allocated memory is still 69.2MB. Free memory was 37.4MB in the beginning and 35.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:10:48,219 INFO L158 Benchmark]: RCFGBuilder took 988.12ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 35.3MB in the beginning and 57.9MB in the end (delta: -22.7MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-11-19 07:10:48,220 INFO L158 Benchmark]: TraceAbstraction took 28628.36ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 57.5MB in the beginning and 117.7MB in the end (delta: -60.2MB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. [2022-11-19 07:10:48,220 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 157.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:10:48,222 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.32ms. Allocated memory is still 69.2MB. Free memory was 50.6MB in the beginning and 50.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 722.95ms. Allocated memory is still 69.2MB. Free memory was 48.4MB in the beginning and 39.8MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.99ms. Allocated memory is still 69.2MB. Free memory was 39.8MB in the beginning and 37.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.24ms. Allocated memory is still 69.2MB. Free memory was 37.4MB in the beginning and 35.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 988.12ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 35.3MB in the beginning and 57.9MB in the end (delta: -22.7MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28628.36ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 57.5MB in the beginning and 117.7MB in the end (delta: -60.2MB). Peak memory consumption was 95.5MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 157.3MB. Free memory is still 117.7MB. 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: 9.9s, 138 PlacesBefore, 44 PlacesAfterwards, 130 TransitionsBefore, 35 TransitionsAfterwards, 2364 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 127 TotalNumberOfCompositions, 5900 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3006, independent: 2840, independent conditional: 0, independent unconditional: 2840, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1680, independent: 1631, independent conditional: 0, independent unconditional: 1631, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1680, independent: 1618, independent conditional: 0, independent unconditional: 1618, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 436, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 404, dependent conditional: 0, dependent unconditional: 404, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3006, independent: 1209, independent conditional: 0, independent unconditional: 1209, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 1680, unknown conditional: 0, unknown unconditional: 1680] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L718] 0 int __unbuffered_p2_EBX = 0; [L725] 0 _Bool x$flush_delayed; [L736] 0 int *x$read_delayed_var; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L726] 0 int x$mem_tmp; [L712] 0 int __unbuffered_p0_EAX = 0; [L730] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff0_thd1; [L714] 0 int __unbuffered_p1_EAX = 0; [L729] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd0; [L720] 0 int a = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L735] 0 _Bool x$read_delayed; [L710] 0 int __unbuffered_cnt = 0; [L722] 0 _Bool main$tmp_guard1; [L740] 0 _Bool x$w_buff1_used; [L721] 0 _Bool main$tmp_guard0; [L738] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff0; [L739] 0 int x$w_buff1; [L724] 0 int x = 0; [L732] 0 _Bool x$r_buff1_thd1; [L731] 0 _Bool x$r_buff1_thd0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L734] 0 _Bool x$r_buff1_thd3; [L733] 0 _Bool x$r_buff1_thd2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=0, t916={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=1, t916={-6:0}, t917={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=2, t916={-6:0}, t917={-10:0}, t918={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 3 y = 1 [L810] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=2, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={-6:0}, t917={-10:0}, t918={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={-6:0}, t917={-10:0}, t918={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: 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: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 842]: 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: 846]: 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: 844]: 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 7 procedures, 158 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 361 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 436 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1321 IncrementalHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 108 mSDtfsCounter, 1321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1028occurred in iteration=0, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 1385 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 419 ConstructedInterpolants, 195 QuantifiedInterpolants, 10252 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3557 ConjunctsInSsa, 265 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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-19 07:10:48,247 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42751182-fd4f-4aae-961d-988c396b9d22/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample