./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a --- 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:23:28,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:23:28,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:23:28,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:23:28,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:23:28,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:23:28,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:23:28,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:23:28,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:23:28,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:23:28,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:23:28,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:23:28,220 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:23:28,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:23:28,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:23:28,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:23:28,228 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:23:28,229 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:23:28,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:23:28,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:23:28,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:23:28,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:23:28,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:23:28,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:23:28,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:23:28,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:23:28,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:23:28,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:23:28,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:23:28,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:23:28,266 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:23:28,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:23:28,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:23:28,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:23:28,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:23:28,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:23:28,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:23:28,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:23:28,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:23:28,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:23:28,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:23:28,280 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 07:23:28,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:23:28,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:23:28,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:23:28,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:23:28,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:23:28,333 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:23:28,333 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:23:28,334 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:23:28,334 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:23:28,334 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:23:28,335 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:23:28,336 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:23:28,336 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:23:28,337 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:23:28,337 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:23:28,337 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:23:28,338 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:23:28,338 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:23:28,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:23:28,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:23:28,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:23:28,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:23:28,342 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:23:28,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:23:28,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:23:28,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:23:28,343 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:23:28,344 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:23:28,344 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:23:28,345 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:23:28,345 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:23:28,345 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:23:28,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:23:28,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:23:28,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:23:28,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:23:28,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:23:28,347 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:23:28,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:23:28,348 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:23:28,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:23:28,349 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:23:28,349 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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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 -> 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a [2022-11-19 07:23:28,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:23:28,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:23:28,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:23:28,749 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:23:28,750 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:23:28,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 07:23:28,845 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/data/e357deb49/936de06aae8f4085850131bc8bd3245d/FLAGc9018f629 [2022-11-19 07:23:29,573 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:23:29,575 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 07:23:29,597 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/data/e357deb49/936de06aae8f4085850131bc8bd3245d/FLAGc9018f629 [2022-11-19 07:23:29,808 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/data/e357deb49/936de06aae8f4085850131bc8bd3245d [2022-11-19 07:23:29,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:23:29,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:23:29,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:23:29,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:23:29,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:23:29,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:23:29" (1/1) ... [2022-11-19 07:23:29,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fcd337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:29, skipping insertion in model container [2022-11-19 07:23:29,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:23:29" (1/1) ... [2022-11-19 07:23:29,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:23:29,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:23:30,123 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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-19 07:23:30,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:23:30,407 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:23:30,424 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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-19 07:23:30,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:23:30,545 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:23:30,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30 WrapperNode [2022-11-19 07:23:30,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:23:30,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:23:30,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:23:30,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:23:30,555 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:23:30" (1/1) ... [2022-11-19 07:23:30,585 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:23:30" (1/1) ... [2022-11-19 07:23:30,611 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-19 07:23:30,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:23:30,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:23:30,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:23:30,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:23:30,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30" (1/1) ... [2022-11-19 07:23:30,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30" (1/1) ... [2022-11-19 07:23:30,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30" (1/1) ... [2022-11-19 07:23:30,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30" (1/1) ... [2022-11-19 07:23:30,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30" (1/1) ... [2022-11-19 07:23:30,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30" (1/1) ... [2022-11-19 07:23:30,660 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30" (1/1) ... [2022-11-19 07:23:30,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30" (1/1) ... [2022-11-19 07:23:30,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:23:30,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:23:30,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:23:30,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:23:30,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30" (1/1) ... [2022-11-19 07:23:30,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:23:30,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:23:30,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:23:30,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:23:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:23:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:23:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:23:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:23:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:23:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:23:30,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:23:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:23:30,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:23:30,786 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:23:30,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:23:30,786 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:23:30,786 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:23:30,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:23:30,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:23:30,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:23:30,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:23:30,789 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:23:31,018 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:23:31,020 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:23:31,539 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:23:31,786 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:23:31,786 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:23:31,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:23:31 BoogieIcfgContainer [2022-11-19 07:23:31,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:23:31,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:23:31,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:23:31,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:23:31,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:23:29" (1/3) ... [2022-11-19 07:23:31,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a3f9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:23:31, skipping insertion in model container [2022-11-19 07:23:31,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:23:30" (2/3) ... [2022-11-19 07:23:31,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a3f9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:23:31, skipping insertion in model container [2022-11-19 07:23:31,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:23:31" (3/3) ... [2022-11-19 07:23:31,818 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 07:23:31,857 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:23:31,858 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-19 07:23:31,858 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:23:31,976 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:23:32,034 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:23:32,052 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-19 07:23:32,058 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-19 07:23:32,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-19 07:23:32,177 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-19 07:23:32,178 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:23:32,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-19 07:23:32,190 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-19 07:23:39,337 INFO L134 LiptonReduction]: Checked pairs total: 11021 [2022-11-19 07:23:39,338 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-11-19 07:23:39,352 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-19 07:23:39,758 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 0 states 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:23:39,776 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:23:39,783 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;@68e04210, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:23:39,783 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-19 07:23:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 0 states 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:23:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:23:39,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:39,824 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:23:39,824 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash 630, now seen corresponding path program 1 times [2022-11-19 07:23:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:39,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917611552] [2022-11-19 07:23:39,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:39,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:39,969 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:23:39,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:39,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917611552] [2022-11-19 07:23:39,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917611552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:39,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:39,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:23:39,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031097119] [2022-11-19 07:23:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:39,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:23:39,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:40,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:23:40,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:23:40,027 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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:23:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:40,263 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-19 07:23:40,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:23:40,266 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:23:40,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:40,340 INFO L225 Difference]: With dead ends: 6074 [2022-11-19 07:23:40,340 INFO L226 Difference]: Without dead ends: 6074 [2022-11-19 07:23:40,341 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:23:40,346 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:40,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-19 07:23:40,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-19 07:23:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 0 states have call successors, (0), 0 states 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:23:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-19 07:23:40,918 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-19 07:23:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:40,919 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-19 07:23:40,919 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:23:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-19 07:23:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:23:40,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:40,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:23:40,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:23:40,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:40,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:40,922 INFO L85 PathProgramCache]: Analyzing trace with hash 619058, now seen corresponding path program 1 times [2022-11-19 07:23:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:40,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586850572] [2022-11-19 07:23:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:41,292 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:23:41,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:41,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586850572] [2022-11-19 07:23:41,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586850572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:41,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:41,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:23:41,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400763419] [2022-11-19 07:23:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:41,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:41,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:41,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:41,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:41,304 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:41,513 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-19 07:23:41,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:41,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 07:23:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:41,628 INFO L225 Difference]: With dead ends: 4962 [2022-11-19 07:23:41,628 INFO L226 Difference]: Without dead ends: 4812 [2022-11-19 07:23:41,629 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:23:41,630 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:41,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-19 07:23:41,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-19 07:23:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 0 states have call successors, (0), 0 states 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:23:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-19 07:23:41,884 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-19 07:23:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:41,884 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-19 07:23:41,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-19 07:23:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:23:41,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:41,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:41,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:23:41,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash 681574990, now seen corresponding path program 1 times [2022-11-19 07:23:41,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:41,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835721106] [2022-11-19 07:23:41,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:41,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:42,450 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:23:42,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:42,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835721106] [2022-11-19 07:23:42,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835721106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:42,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:42,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:23:42,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420702945] [2022-11-19 07:23:42,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:42,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:42,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:42,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:42,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:42,455 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 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:23:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:42,787 INFO L93 Difference]: Finished difference Result 8166 states and 31854 transitions. [2022-11-19 07:23:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:42,788 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:23:42,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:42,881 INFO L225 Difference]: With dead ends: 8166 [2022-11-19 07:23:42,881 INFO L226 Difference]: Without dead ends: 8166 [2022-11-19 07:23:42,883 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:23:42,886 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:42,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2022-11-19 07:23:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 6268. [2022-11-19 07:23:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6268 states, 6266 states have (on average 4.0017555059048835) internal successors, (25075), 6267 states have internal predecessors, (25075), 0 states have call successors, (0), 0 states 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:23:43,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6268 states to 6268 states and 25075 transitions. [2022-11-19 07:23:43,254 INFO L78 Accepts]: Start accepts. Automaton has 6268 states and 25075 transitions. Word has length 11 [2022-11-19 07:23:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:43,255 INFO L495 AbstractCegarLoop]: Abstraction has 6268 states and 25075 transitions. [2022-11-19 07:23:43,256 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:23:43,256 INFO L276 IsEmpty]: Start isEmpty. Operand 6268 states and 25075 transitions. [2022-11-19 07:23:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:23:43,259 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:43,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:43,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:23:43,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:43,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:43,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1838852150, now seen corresponding path program 1 times [2022-11-19 07:23:43,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:43,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777102531] [2022-11-19 07:23:43,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:43,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:43,544 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:23:43,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:43,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777102531] [2022-11-19 07:23:43,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777102531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:43,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:43,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:23:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335033149] [2022-11-19 07:23:43,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:43,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:43,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:43,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:43,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:43,554 INFO L87 Difference]: Start difference. First operand 6268 states and 25075 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:43,768 INFO L93 Difference]: Finished difference Result 7338 states and 28626 transitions. [2022-11-19 07:23:43,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:23:43,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 07:23:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:43,809 INFO L225 Difference]: With dead ends: 7338 [2022-11-19 07:23:43,810 INFO L226 Difference]: Without dead ends: 7338 [2022-11-19 07:23:43,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:43,811 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:43,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 10 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:43,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7338 states. [2022-11-19 07:23:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7338 to 5462. [2022-11-19 07:23:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5462 states, 5460 states have (on average 3.9954212454212454) internal successors, (21815), 5461 states have internal predecessors, (21815), 0 states have call successors, (0), 0 states 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:23:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5462 states to 5462 states and 21815 transitions. [2022-11-19 07:23:44,210 INFO L78 Accepts]: Start accepts. Automaton has 5462 states and 21815 transitions. Word has length 12 [2022-11-19 07:23:44,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:44,211 INFO L495 AbstractCegarLoop]: Abstraction has 5462 states and 21815 transitions. [2022-11-19 07:23:44,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 5462 states and 21815 transitions. [2022-11-19 07:23:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:23:44,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:44,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:44,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:23:44,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:44,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:44,222 INFO L85 PathProgramCache]: Analyzing trace with hash -346010846, now seen corresponding path program 1 times [2022-11-19 07:23:44,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:44,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189847849] [2022-11-19 07:23:44,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:44,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:45,064 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:23:45,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:45,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189847849] [2022-11-19 07:23:45,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189847849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:45,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:45,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:23:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237015499] [2022-11-19 07:23:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:45,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:23:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:45,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:23:45,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:23:45,067 INFO L87 Difference]: Start difference. First operand 5462 states and 21815 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:45,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:45,557 INFO L93 Difference]: Finished difference Result 5712 states and 22290 transitions. [2022-11-19 07:23:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:23:45,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 07:23:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:45,591 INFO L225 Difference]: With dead ends: 5712 [2022-11-19 07:23:45,592 INFO L226 Difference]: Without dead ends: 4962 [2022-11-19 07:23:45,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:23:45,593 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 54 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:45,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 63 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:23:45,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4962 states. [2022-11-19 07:23:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4962 to 4962. [2022-11-19 07:23:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4962 states, 4960 states have (on average 3.9546370967741935) internal successors, (19615), 4961 states have internal predecessors, (19615), 0 states have call successors, (0), 0 states 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:23:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4962 states to 4962 states and 19615 transitions. [2022-11-19 07:23:45,856 INFO L78 Accepts]: Start accepts. Automaton has 4962 states and 19615 transitions. Word has length 12 [2022-11-19 07:23:45,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:45,856 INFO L495 AbstractCegarLoop]: Abstraction has 4962 states and 19615 transitions. [2022-11-19 07:23:45,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:45,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4962 states and 19615 transitions. [2022-11-19 07:23:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-19 07:23:45,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:45,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:45,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:23:45,861 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:45,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:45,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2059521801, now seen corresponding path program 1 times [2022-11-19 07:23:45,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:45,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010908033] [2022-11-19 07:23:45,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:46,117 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:23:46,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:46,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010908033] [2022-11-19 07:23:46,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010908033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:46,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:46,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:23:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477649483] [2022-11-19 07:23:46,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:46,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:46,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:46,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:46,121 INFO L87 Difference]: Start difference. First operand 4962 states and 19615 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:46,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:46,394 INFO L93 Difference]: Finished difference Result 6646 states and 25539 transitions. [2022-11-19 07:23:46,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:23:46,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-19 07:23:46,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:46,437 INFO L225 Difference]: With dead ends: 6646 [2022-11-19 07:23:46,438 INFO L226 Difference]: Without dead ends: 6646 [2022-11-19 07:23:46,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:46,440 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:46,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 11 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:23:46,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6646 states. [2022-11-19 07:23:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6646 to 4922. [2022-11-19 07:23:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4922 states, 4920 states have (on average 3.9497967479674796) internal successors, (19433), 4921 states have internal predecessors, (19433), 0 states have call successors, (0), 0 states 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:23:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4922 states to 4922 states and 19433 transitions. [2022-11-19 07:23:46,668 INFO L78 Accepts]: Start accepts. Automaton has 4922 states and 19433 transitions. Word has length 13 [2022-11-19 07:23:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:46,668 INFO L495 AbstractCegarLoop]: Abstraction has 4922 states and 19433 transitions. [2022-11-19 07:23:46,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4922 states and 19433 transitions. [2022-11-19 07:23:46,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-19 07:23:46,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:46,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:46,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:23:46,674 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2004372091, now seen corresponding path program 1 times [2022-11-19 07:23:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:46,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347893054] [2022-11-19 07:23:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:46,907 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:23:46,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:46,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347893054] [2022-11-19 07:23:46,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347893054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:46,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:46,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:23:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294643294] [2022-11-19 07:23:46,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:46,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:46,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:46,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:46,909 INFO L87 Difference]: Start difference. First operand 4922 states and 19433 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:23:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:47,112 INFO L93 Difference]: Finished difference Result 4588 states and 16163 transitions. [2022-11-19 07:23:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:23:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:23:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:47,134 INFO L225 Difference]: With dead ends: 4588 [2022-11-19 07:23:47,134 INFO L226 Difference]: Without dead ends: 3538 [2022-11-19 07:23:47,135 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:23:47,136 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:47,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 20 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:23:47,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2022-11-19 07:23:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3538. [2022-11-19 07:23:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3538 states, 3536 states have (on average 3.5115950226244346) internal successors, (12417), 3537 states have internal predecessors, (12417), 0 states have call successors, (0), 0 states 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:23:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 12417 transitions. [2022-11-19 07:23:47,247 INFO L78 Accepts]: Start accepts. Automaton has 3538 states and 12417 transitions. Word has length 14 [2022-11-19 07:23:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:47,248 INFO L495 AbstractCegarLoop]: Abstraction has 3538 states and 12417 transitions. [2022-11-19 07:23:47,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:23:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 12417 transitions. [2022-11-19 07:23:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:23:47,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:47,253 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:23:47,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:23:47,254 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:47,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1317107275, now seen corresponding path program 1 times [2022-11-19 07:23:47,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:47,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369921463] [2022-11-19 07:23:47,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:47,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:47,500 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:23:47,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:47,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369921463] [2022-11-19 07:23:47,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369921463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:47,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:47,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:23:47,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480117318] [2022-11-19 07:23:47,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:47,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:23:47,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:47,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:23:47,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:47,502 INFO L87 Difference]: Start difference. First operand 3538 states and 12417 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:23:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:47,660 INFO L93 Difference]: Finished difference Result 4954 states and 17042 transitions. [2022-11-19 07:23:47,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:23:47,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:23:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:47,685 INFO L225 Difference]: With dead ends: 4954 [2022-11-19 07:23:47,686 INFO L226 Difference]: Without dead ends: 4954 [2022-11-19 07:23:47,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:23:47,688 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:47,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 10 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:47,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4954 states. [2022-11-19 07:23:47,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4954 to 3778. [2022-11-19 07:23:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3778 states, 3776 states have (on average 3.4827860169491527) internal successors, (13151), 3777 states have internal predecessors, (13151), 0 states have call successors, (0), 0 states 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:23:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3778 states to 3778 states and 13151 transitions. [2022-11-19 07:23:47,826 INFO L78 Accepts]: Start accepts. Automaton has 3778 states and 13151 transitions. Word has length 17 [2022-11-19 07:23:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:47,826 INFO L495 AbstractCegarLoop]: Abstraction has 3778 states and 13151 transitions. [2022-11-19 07:23:47,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:23:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3778 states and 13151 transitions. [2022-11-19 07:23:47,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:23:47,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:47,833 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:23:47,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:23:47,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:47,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1163582049, now seen corresponding path program 1 times [2022-11-19 07:23:47,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:47,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088009077] [2022-11-19 07:23:47,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:47,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:48,082 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:23:48,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:48,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088009077] [2022-11-19 07:23:48,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088009077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:48,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:48,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:23:48,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769698967] [2022-11-19 07:23:48,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:48,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:23:48,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:48,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:23:48,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:48,085 INFO L87 Difference]: Start difference. First operand 3778 states and 13151 transitions. Second operand has 5 states, 5 states have (on average 3.4) 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:23:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:48,318 INFO L93 Difference]: Finished difference Result 2948 states and 9270 transitions. [2022-11-19 07:23:48,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:23:48,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) 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:23:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:48,330 INFO L225 Difference]: With dead ends: 2948 [2022-11-19 07:23:48,330 INFO L226 Difference]: Without dead ends: 2278 [2022-11-19 07:23:48,331 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:23:48,331 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 74 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:48,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 28 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:23:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2022-11-19 07:23:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2278. [2022-11-19 07:23:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2276 states have (on average 3.0971001757469243) internal successors, (7049), 2277 states have internal predecessors, (7049), 0 states have call successors, (0), 0 states 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:23:48,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 7049 transitions. [2022-11-19 07:23:48,402 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 7049 transitions. Word has length 17 [2022-11-19 07:23:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:48,402 INFO L495 AbstractCegarLoop]: Abstraction has 2278 states and 7049 transitions. [2022-11-19 07:23:48,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) 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:23:48,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 7049 transitions. [2022-11-19 07:23:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:23:48,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:48,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:48,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:23:48,408 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:48,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:48,409 INFO L85 PathProgramCache]: Analyzing trace with hash 562641020, now seen corresponding path program 1 times [2022-11-19 07:23:48,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:48,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232503197] [2022-11-19 07:23:48,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:48,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:48,825 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:23:48,825 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:48,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232503197] [2022-11-19 07:23:48,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232503197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:48,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:48,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:23:48,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946605377] [2022-11-19 07:23:48,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:48,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:23:48,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:23:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:23:48,829 INFO L87 Difference]: Start difference. First operand 2278 states and 7049 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:49,112 INFO L93 Difference]: Finished difference Result 1891 states and 5767 transitions. [2022-11-19 07:23:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:23:49,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-19 07:23:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:49,121 INFO L225 Difference]: With dead ends: 1891 [2022-11-19 07:23:49,122 INFO L226 Difference]: Without dead ends: 1679 [2022-11-19 07:23:49,122 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:23:49,123 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 97 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:49,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 32 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:23:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-11-19 07:23:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2022-11-19 07:23:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1677 states have (on average 3.1001788908765655) internal successors, (5199), 1678 states have internal predecessors, (5199), 0 states have call successors, (0), 0 states 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:23:49,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 5199 transitions. [2022-11-19 07:23:49,183 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 5199 transitions. Word has length 20 [2022-11-19 07:23:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:49,183 INFO L495 AbstractCegarLoop]: Abstraction has 1679 states and 5199 transitions. [2022-11-19 07:23:49,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:49,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 5199 transitions. [2022-11-19 07:23:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:23:49,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:49,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:49,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:23:49,192 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:49,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1484067928, now seen corresponding path program 1 times [2022-11-19 07:23:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:49,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595053866] [2022-11-19 07:23:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:49,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:50,322 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:23:50,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:50,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595053866] [2022-11-19 07:23:50,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595053866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:50,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:50,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:23:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314153600] [2022-11-19 07:23:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:50,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:23:50,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:50,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:23:50,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:23:50,327 INFO L87 Difference]: Start difference. First operand 1679 states and 5199 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:50,732 INFO L93 Difference]: Finished difference Result 2812 states and 8375 transitions. [2022-11-19 07:23:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:23:50,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-19 07:23:50,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:50,749 INFO L225 Difference]: With dead ends: 2812 [2022-11-19 07:23:50,749 INFO L226 Difference]: Without dead ends: 2812 [2022-11-19 07:23:50,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:23:50,750 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:50,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 40 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:23:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states. [2022-11-19 07:23:50,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 1811. [2022-11-19 07:23:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1809 states have (on average 3.1028192371475956) internal successors, (5613), 1810 states have internal predecessors, (5613), 0 states have call successors, (0), 0 states 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:23:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 5613 transitions. [2022-11-19 07:23:50,832 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 5613 transitions. Word has length 24 [2022-11-19 07:23:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:50,833 INFO L495 AbstractCegarLoop]: Abstraction has 1811 states and 5613 transitions. [2022-11-19 07:23:50,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 5613 transitions. [2022-11-19 07:23:50,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:23:50,839 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:50,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:50,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:23:50,840 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:50,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:50,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1669919856, now seen corresponding path program 2 times [2022-11-19 07:23:50,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:50,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31165174] [2022-11-19 07:23:50,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:50,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:51,976 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:23:51,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:51,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31165174] [2022-11-19 07:23:51,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31165174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:51,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:51,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:23:51,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049817097] [2022-11-19 07:23:51,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:51,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:23:51,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:51,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:23:51,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:23:51,980 INFO L87 Difference]: Start difference. First operand 1811 states and 5613 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:52,651 INFO L93 Difference]: Finished difference Result 3232 states and 9632 transitions. [2022-11-19 07:23:52,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:23:52,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-19 07:23:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:52,668 INFO L225 Difference]: With dead ends: 3232 [2022-11-19 07:23:52,668 INFO L226 Difference]: Without dead ends: 3232 [2022-11-19 07:23:52,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:23:52,670 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 126 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:52,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 37 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:23:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2022-11-19 07:23:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1902. [2022-11-19 07:23:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1900 states have (on average 3.082105263157895) internal successors, (5856), 1901 states have internal predecessors, (5856), 0 states have call successors, (0), 0 states 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:23:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 5856 transitions. [2022-11-19 07:23:52,760 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 5856 transitions. Word has length 24 [2022-11-19 07:23:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:52,761 INFO L495 AbstractCegarLoop]: Abstraction has 1902 states and 5856 transitions. [2022-11-19 07:23:52,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 5856 transitions. [2022-11-19 07:23:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 07:23:52,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:52,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:52,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:23:52,769 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:52,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1458158384, now seen corresponding path program 3 times [2022-11-19 07:23:52,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:52,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465261465] [2022-11-19 07:23:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:52,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:53,130 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:23:53,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:53,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465261465] [2022-11-19 07:23:53,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465261465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:53,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:53,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:23:53,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494626162] [2022-11-19 07:23:53,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:53,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:23:53,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:53,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:23:53,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:23:53,134 INFO L87 Difference]: Start difference. First operand 1902 states and 5856 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:53,415 INFO L93 Difference]: Finished difference Result 1826 states and 5682 transitions. [2022-11-19 07:23:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:23:53,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-19 07:23:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:53,421 INFO L225 Difference]: With dead ends: 1826 [2022-11-19 07:23:53,421 INFO L226 Difference]: Without dead ends: 1787 [2022-11-19 07:23:53,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:23:53,422 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 93 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:53,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 32 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:53,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2022-11-19 07:23:53,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1683. [2022-11-19 07:23:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1681 states have (on average 3.1671624033313504) internal successors, (5324), 1682 states have internal predecessors, (5324), 0 states have call successors, (0), 0 states 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:23:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 5324 transitions. [2022-11-19 07:23:53,462 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 5324 transitions. Word has length 24 [2022-11-19 07:23:53,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:53,463 INFO L495 AbstractCegarLoop]: Abstraction has 1683 states and 5324 transitions. [2022-11-19 07:23:53,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:23:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 5324 transitions. [2022-11-19 07:23:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:23:53,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:53,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:53,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:23:53,470 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1576501212, now seen corresponding path program 1 times [2022-11-19 07:23:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:53,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965966118] [2022-11-19 07:23:53,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:53,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:53,723 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:23:53,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:53,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965966118] [2022-11-19 07:23:53,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965966118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:53,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:53,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:23:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700444888] [2022-11-19 07:23:53,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:53,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:53,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:53,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:53,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:53,726 INFO L87 Difference]: Start difference. First operand 1683 states and 5324 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:23:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:53,878 INFO L93 Difference]: Finished difference Result 2457 states and 7667 transitions. [2022-11-19 07:23:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:23:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-19 07:23:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:53,892 INFO L225 Difference]: With dead ends: 2457 [2022-11-19 07:23:53,892 INFO L226 Difference]: Without dead ends: 2457 [2022-11-19 07:23:53,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:53,893 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:53,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:53,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2022-11-19 07:23:53,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 1483. [2022-11-19 07:23:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1481 states have (on average 3.1586765698852126) internal successors, (4678), 1482 states have internal predecessors, (4678), 0 states have call successors, (0), 0 states 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:23:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 4678 transitions. [2022-11-19 07:23:53,938 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 4678 transitions. Word has length 28 [2022-11-19 07:23:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:53,939 INFO L495 AbstractCegarLoop]: Abstraction has 1483 states and 4678 transitions. [2022-11-19 07:23:53,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:23:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 4678 transitions. [2022-11-19 07:23:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:23:53,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:53,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:53,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:23:53,946 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:53,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash -725911724, now seen corresponding path program 2 times [2022-11-19 07:23:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:53,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646208013] [2022-11-19 07:23:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:53,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:54,228 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:23:54,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:54,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646208013] [2022-11-19 07:23:54,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646208013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:54,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:54,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:23:54,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948247372] [2022-11-19 07:23:54,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:54,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:23:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:54,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:23:54,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:23:54,230 INFO L87 Difference]: Start difference. First operand 1483 states and 4678 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:23:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:54,362 INFO L93 Difference]: Finished difference Result 1999 states and 6213 transitions. [2022-11-19 07:23:54,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:23:54,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-19 07:23:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:54,369 INFO L225 Difference]: With dead ends: 1999 [2022-11-19 07:23:54,369 INFO L226 Difference]: Without dead ends: 1999 [2022-11-19 07:23:54,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:23:54,370 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:54,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 13 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:23:54,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2022-11-19 07:23:54,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1372. [2022-11-19 07:23:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1370 states have (on average 3.156934306569343) internal successors, (4325), 1371 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states 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:23:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 4325 transitions. [2022-11-19 07:23:54,410 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 4325 transitions. Word has length 28 [2022-11-19 07:23:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:54,411 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 4325 transitions. [2022-11-19 07:23:54,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:23:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 4325 transitions. [2022-11-19 07:23:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:23:54,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:54,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:54,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:23:54,416 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:54,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash 667460692, now seen corresponding path program 3 times [2022-11-19 07:23:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:54,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362168715] [2022-11-19 07:23:54,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:54,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:55,336 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:23:55,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:55,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362168715] [2022-11-19 07:23:55,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362168715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:55,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:55,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:23:55,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874125345] [2022-11-19 07:23:55,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:55,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:23:55,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:55,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:23:55,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:23:55,343 INFO L87 Difference]: Start difference. First operand 1372 states and 4325 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:23:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:55,701 INFO L93 Difference]: Finished difference Result 1962 states and 5955 transitions. [2022-11-19 07:23:55,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:23:55,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-19 07:23:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:55,708 INFO L225 Difference]: With dead ends: 1962 [2022-11-19 07:23:55,708 INFO L226 Difference]: Without dead ends: 1962 [2022-11-19 07:23:55,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:23:55,709 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 81 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:55,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 39 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:55,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2022-11-19 07:23:55,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1372. [2022-11-19 07:23:55,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 1370 states have (on average 3.156934306569343) internal successors, (4325), 1371 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states 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:23:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 4325 transitions. [2022-11-19 07:23:55,747 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 4325 transitions. Word has length 28 [2022-11-19 07:23:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:55,748 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 4325 transitions. [2022-11-19 07:23:55,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:23:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 4325 transitions. [2022-11-19 07:23:55,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:23:55,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:55,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:55,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:23:55,753 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:55,755 INFO L85 PathProgramCache]: Analyzing trace with hash -397828166, now seen corresponding path program 4 times [2022-11-19 07:23:55,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:55,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034955527] [2022-11-19 07:23:55,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:55,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:23:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:23:56,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:23:56,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034955527] [2022-11-19 07:23:56,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034955527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:23:56,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:23:56,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:23:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506272036] [2022-11-19 07:23:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:23:56,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:23:56,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:23:56,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:23:56,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:23:56,871 INFO L87 Difference]: Start difference. First operand 1372 states and 4325 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:23:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:23:57,223 INFO L93 Difference]: Finished difference Result 1552 states and 4799 transitions. [2022-11-19 07:23:57,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:23:57,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-19 07:23:57,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:23:57,228 INFO L225 Difference]: With dead ends: 1552 [2022-11-19 07:23:57,228 INFO L226 Difference]: Without dead ends: 1552 [2022-11-19 07:23:57,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:23:57,229 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:23:57,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 44 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:23:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2022-11-19 07:23:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1224. [2022-11-19 07:23:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1222 states have (on average 3.190671031096563) internal successors, (3899), 1223 states have internal predecessors, (3899), 0 states have call successors, (0), 0 states 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:23:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 3899 transitions. [2022-11-19 07:23:57,261 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 3899 transitions. Word has length 28 [2022-11-19 07:23:57,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:23:57,261 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 3899 transitions. [2022-11-19 07:23:57,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:23:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 3899 transitions. [2022-11-19 07:23:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:23:57,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:23:57,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:57,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-19 07:23:57,266 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:23:57,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:23:57,266 INFO L85 PathProgramCache]: Analyzing trace with hash -242513600, now seen corresponding path program 5 times [2022-11-19 07:23:57,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:23:57,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384369765] [2022-11-19 07:23:57,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:23:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:23:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:23:57,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:23:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:23:57,460 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:23:57,460 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:23:57,461 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-19 07:23:57,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-19 07:23:57,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-19 07:23:57,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-19 07:23:57,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-19 07:23:57,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-19 07:23:57,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-19 07:23:57,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-19 07:23:57,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-19 07:23:57,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-19 07:23:57,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-19 07:23:57,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-19 07:23:57,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-19 07:23:57,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-19 07:23:57,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-19 07:23:57,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-19 07:23:57,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-19 07:23:57,470 INFO L444 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:23:57,476 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:23:57,476 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:23:57,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:23:57 BasicIcfg [2022-11-19 07:23:57,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:23:57,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:23:57,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:23:57,590 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:23:57,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:23:31" (3/4) ... [2022-11-19 07:23:57,593 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:23:57,594 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:23:57,594 INFO L158 Benchmark]: Toolchain (without parser) took 27779.72ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 83.2MB in the beginning and 839.9MB in the end (delta: -756.7MB). Peak memory consumption was 393.7MB. Max. memory is 16.1GB. [2022-11-19 07:23:57,594 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 121.6MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:23:57,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 727.26ms. Allocated memory is still 121.6MB. Free memory was 83.0MB in the beginning and 84.4MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:23:57,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.71ms. Allocated memory is still 121.6MB. Free memory was 84.4MB in the beginning and 81.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:23:57,595 INFO L158 Benchmark]: Boogie Preprocessor took 53.48ms. Allocated memory is still 121.6MB. Free memory was 81.8MB in the beginning and 79.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:23:57,596 INFO L158 Benchmark]: RCFGBuilder took 1136.30ms. Allocated memory is still 121.6MB. Free memory was 79.8MB in the beginning and 95.3MB in the end (delta: -15.5MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2022-11-19 07:23:57,596 INFO L158 Benchmark]: TraceAbstraction took 25779.61ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 94.8MB in the beginning and 841.0MB in the end (delta: -746.1MB). Peak memory consumption was 404.4MB. Max. memory is 16.1GB. [2022-11-19 07:23:57,596 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 1.3GB. Free memory was 841.0MB in the beginning and 839.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:23:57,598 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.31ms. Allocated memory is still 121.6MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 727.26ms. Allocated memory is still 121.6MB. Free memory was 83.0MB in the beginning and 84.4MB in the end (delta: -1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.71ms. Allocated memory is still 121.6MB. Free memory was 84.4MB in the beginning and 81.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.48ms. Allocated memory is still 121.6MB. Free memory was 81.8MB in the beginning and 79.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1136.30ms. Allocated memory is still 121.6MB. Free memory was 79.8MB in the beginning and 95.3MB in the end (delta: -15.5MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * TraceAbstraction took 25779.61ms. Allocated memory was 121.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 94.8MB in the beginning and 841.0MB in the end (delta: -746.1MB). Peak memory consumption was 404.4MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 1.3GB. Free memory was 841.0MB in the beginning and 839.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 161 PlacesBefore, 57 PlacesAfterwards, 150 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 11021 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5818, independent: 5576, independent conditional: 0, independent unconditional: 5576, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2905, independent: 2813, independent conditional: 0, independent unconditional: 2813, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2905, independent: 2778, independent conditional: 0, independent unconditional: 2778, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 127, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 674, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 595, dependent conditional: 0, dependent unconditional: 595, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5818, independent: 2763, independent conditional: 0, independent unconditional: 2763, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 2905, unknown conditional: 0, unknown unconditional: 2905] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 370, Positive conditional cache size: 0, Positive unconditional cache size: 370, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L738] 0 _Bool a$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L722] 0 int a$mem_tmp; [L733] 0 _Bool a$read_delayed; [L712] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L731] 0 _Bool a$r_buff1_thd3; [L714] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$r_buff1_thd1; [L735] 0 int a$w_buff0; [L730] 0 _Bool a$r_buff1_thd2; [L737] 0 int a$w_buff1; [L721] 0 _Bool a$flush_delayed; [L728] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L734] 0 int *a$read_delayed_var; [L740] 0 _Bool main$tmp_guard1; [L739] 0 _Bool main$tmp_guard0; [L736] 0 _Bool a$w_buff0_used; [L724] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd0; [L716] 0 int __unbuffered_p3_EAX = 0; [L726] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd4; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L866] 0 pthread_t t465; [L867] FCALL, FORK 0 pthread_create(&t465, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t465, ((void *)0), P0, ((void *)0))=-1, t465={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t466; [L869] FCALL, FORK 0 pthread_create(&t466, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t466, ((void *)0), P1, ((void *)0))=0, t465={5:0}, t466={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L870] 0 pthread_t t467; [L871] FCALL, FORK 0 pthread_create(&t467, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t467, ((void *)0), P2, ((void *)0))=1, t465={5:0}, t466={6:0}, t467={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L872] 0 pthread_t t468; [L873] FCALL, FORK 0 pthread_create(&t468, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t468, ((void *)0), P3, ((void *)0))=2, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t465={5:0}, t466={6:0}, t467={7:0}, t468={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 187 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 25.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 899 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 899 mSDsluCounter, 412 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 273 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2563 IncrementalHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 139 mSDtfsCounter, 2563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 11628 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 2678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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:23:57,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a --- 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:23:59,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:23:59,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:23:59,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:23:59,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:23:59,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:23:59,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:23:59,932 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:23:59,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:23:59,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:23:59,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:23:59,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:23:59,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:23:59,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:23:59,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:23:59,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:23:59,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:23:59,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:23:59,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:23:59,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:23:59,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:23:59,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:23:59,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:23:59,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:23:59,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:23:59,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:23:59,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:23:59,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:23:59,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:23:59,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:23:59,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:23:59,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:23:59,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:23:59,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:23:59,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:23:59,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:23:59,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:23:59,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:23:59,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:23:59,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:23:59,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:23:59,973 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 07:24:00,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:24:00,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:24:00,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:24:00,022 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:24:00,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:24:00,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:24:00,025 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:24:00,026 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:24:00,026 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:24:00,026 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:24:00,027 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:24:00,027 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:24:00,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:24:00,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:24:00,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:24:00,029 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:24:00,030 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:24:00,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:24:00,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:24:00,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:24:00,030 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:24:00,031 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:24:00,031 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:24:00,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:24:00,031 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:24:00,031 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 07:24:00,032 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 07:24:00,032 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:24:00,032 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:24:00,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:24:00,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 07:24:00,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:24:00,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:24:00,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:24:00,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:24:00,034 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 07:24:00,035 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 07:24:00,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:24:00,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 07:24:00,035 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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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 -> 5a744aa24a15b244d86986861038a45981c329f5578e2da992d82373e2f73c5a [2022-11-19 07:24:00,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:24:00,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:24:00,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:24:00,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:24:00,431 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:24:00,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 07:24:00,509 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/data/5d74a36dc/b45c12dc772c4f34b053320b99fc0a81/FLAGa0d9d3f09 [2022-11-19 07:24:01,131 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:24:01,131 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 07:24:01,147 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/data/5d74a36dc/b45c12dc772c4f34b053320b99fc0a81/FLAGa0d9d3f09 [2022-11-19 07:24:01,432 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/data/5d74a36dc/b45c12dc772c4f34b053320b99fc0a81 [2022-11-19 07:24:01,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:24:01,438 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:24:01,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:24:01,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:24:01,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:24:01,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:24:01" (1/1) ... [2022-11-19 07:24:01,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ac25927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:01, skipping insertion in model container [2022-11-19 07:24:01,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:24:01" (1/1) ... [2022-11-19 07:24:01,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:24:01,506 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:24:01,664 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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-19 07:24:01,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:24:01,904 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:24:01,916 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_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/sv-benchmarks/c/pthread-wmm/mix018_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-19 07:24:01,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:24:02,028 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:24:02,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02 WrapperNode [2022-11-19 07:24:02,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:24:02,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:24:02,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:24:02,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:24:02,039 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:24:02" (1/1) ... [2022-11-19 07:24:02,074 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:24:02" (1/1) ... [2022-11-19 07:24:02,126 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-19 07:24:02,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:24:02,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:24:02,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:24:02,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:24:02,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02" (1/1) ... [2022-11-19 07:24:02,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02" (1/1) ... [2022-11-19 07:24:02,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02" (1/1) ... [2022-11-19 07:24:02,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02" (1/1) ... [2022-11-19 07:24:02,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02" (1/1) ... [2022-11-19 07:24:02,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02" (1/1) ... [2022-11-19 07:24:02,159 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02" (1/1) ... [2022-11-19 07:24:02,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02" (1/1) ... [2022-11-19 07:24:02,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:24:02,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:24:02,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:24:02,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:24:02,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02" (1/1) ... [2022-11-19 07:24:02,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:24:02,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:24:02,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:24:02,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:24:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:24:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:24:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:24:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:24:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 07:24:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 07:24:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:24:02,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:24:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:24:02,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:24:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:24:02,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:24:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:24:02,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:24:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:24:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:24:02,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:24:02,264 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:24:02,518 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:24:02,520 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:24:02,991 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:24:03,167 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:24:03,168 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:24:03,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:03 BoogieIcfgContainer [2022-11-19 07:24:03,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:24:03,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:24:03,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:24:03,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:24:03,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:24:01" (1/3) ... [2022-11-19 07:24:03,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67230b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:24:03, skipping insertion in model container [2022-11-19 07:24:03,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:02" (2/3) ... [2022-11-19 07:24:03,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67230b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:24:03, skipping insertion in model container [2022-11-19 07:24:03,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:03" (3/3) ... [2022-11-19 07:24:03,181 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_power.oepc_pso.oepc_rmo.oepc.i [2022-11-19 07:24:03,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:24:03,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-19 07:24:03,200 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:24:03,289 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:24:03,333 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:24:03,348 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 151 transitions, 322 flow [2022-11-19 07:24:03,351 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 151 transitions, 322 flow [2022-11-19 07:24:03,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-11-19 07:24:03,415 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-11-19 07:24:03,415 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:24:03,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-19 07:24:03,430 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-19 07:24:13,803 INFO L134 LiptonReduction]: Checked pairs total: 10967 [2022-11-19 07:24:13,803 INFO L136 LiptonReduction]: Total number of compositions: 146 [2022-11-19 07:24:13,817 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-19 07:24:14,166 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 0 states 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:24:14,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:24:14,199 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;@4964547, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:24:14,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-19 07:24:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 0 states 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:24:14,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:24:14,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:14,244 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:24:14,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash 632, now seen corresponding path program 1 times [2022-11-19 07:24:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:14,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621536876] [2022-11-19 07:24:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:14,265 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:24:14,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:14,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:14,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:14,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 07:24:14,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:14,388 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:24:14,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:14,389 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:24:14,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621536876] [2022-11-19 07:24:14,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621536876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:14,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:14,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:24:14,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668759199] [2022-11-19 07:24:14,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:14,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:24:14,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:24:14,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:24:14,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:24:14,449 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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:24:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:14,829 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-19 07:24:14,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:24:14,832 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:24:14,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:14,960 INFO L225 Difference]: With dead ends: 6074 [2022-11-19 07:24:14,961 INFO L226 Difference]: Without dead ends: 6074 [2022-11-19 07:24:14,962 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:24:14,967 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:14,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-19 07:24:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-19 07:24:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 0 states have call successors, (0), 0 states 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:24:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-19 07:24:15,455 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-19 07:24:15,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:15,456 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-19 07:24:15,456 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:24:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-19 07:24:15,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-19 07:24:15,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:15,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-19 07:24:15,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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)] Ended with exit code 0 [2022-11-19 07:24:15,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:15,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash 622968, now seen corresponding path program 1 times [2022-11-19 07:24:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:15,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855441434] [2022-11-19 07:24:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:15,660 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:24:15,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:15,665 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:15,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:15,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:24:15,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:15,805 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:24:15,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:15,806 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:24:15,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855441434] [2022-11-19 07:24:15,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855441434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:15,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:15,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:24:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810477053] [2022-11-19 07:24:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:15,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:24:15,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:24:15,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:24:15,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:24:15,814 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:16,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:16,048 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-19 07:24:16,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:24:16,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-19 07:24:16,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:16,141 INFO L225 Difference]: With dead ends: 4962 [2022-11-19 07:24:16,141 INFO L226 Difference]: Without dead ends: 4812 [2022-11-19 07:24:16,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:24:16,143 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:16,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-19 07:24:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-19 07:24:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 0 states have call successors, (0), 0 states 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:24:16,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-19 07:24:16,510 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-19 07:24:16,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:16,527 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-19 07:24:16,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:16,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-19 07:24:16,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:24:16,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:16,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:16,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:16,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:16,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2031042452, now seen corresponding path program 1 times [2022-11-19 07:24:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:16,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1843575254] [2022-11-19 07:24:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:16,743 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:24:16,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:16,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:16,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:16,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:24:16,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:16,971 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:24:16,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:16,973 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:24:16,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1843575254] [2022-11-19 07:24:16,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1843575254] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:16,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:16,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:24:16,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857804816] [2022-11-19 07:24:16,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:16,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:24:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:16,977 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 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:24:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:17,330 INFO L93 Difference]: Finished difference Result 3962 states and 14045 transitions. [2022-11-19 07:24:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:24:17,331 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:24:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:17,360 INFO L225 Difference]: With dead ends: 3962 [2022-11-19 07:24:17,360 INFO L226 Difference]: Without dead ends: 3212 [2022-11-19 07:24:17,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:17,361 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 48 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:17,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 20 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:24:17,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-11-19 07:24:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2022-11-19 07:24:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 3210 states have (on average 3.520249221183801) internal successors, (11300), 3211 states have internal predecessors, (11300), 0 states have call successors, (0), 0 states 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:24:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 11300 transitions. [2022-11-19 07:24:17,499 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 11300 transitions. Word has length 11 [2022-11-19 07:24:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:17,500 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 11300 transitions. [2022-11-19 07:24:17,501 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:24:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 11300 transitions. [2022-11-19 07:24:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:24:17,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:17,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:17,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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)] Ended with exit code 0 [2022-11-19 07:24:17,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:17,733 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1019567008, now seen corresponding path program 1 times [2022-11-19 07:24:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:17,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504916245] [2022-11-19 07:24:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:17,735 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:24:17,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:17,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:17,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:17,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:24:17,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:17,932 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:24:17,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:17,933 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:24:17,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504916245] [2022-11-19 07:24:17,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504916245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:17,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:17,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:24:17,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501656991] [2022-11-19 07:24:17,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:17,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:17,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:24:17,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:17,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:17,935 INFO L87 Difference]: Start difference. First operand 3212 states and 11300 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:18,272 INFO L93 Difference]: Finished difference Result 2122 states and 6669 transitions. [2022-11-19 07:24:18,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:24:18,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:24:18,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:18,282 INFO L225 Difference]: With dead ends: 2122 [2022-11-19 07:24:18,282 INFO L226 Difference]: Without dead ends: 1692 [2022-11-19 07:24:18,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:24:18,283 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:18,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 36 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:24:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2022-11-19 07:24:18,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1692. [2022-11-19 07:24:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 3.088757396449704) internal successors, (5220), 1691 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states 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:24:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 5220 transitions. [2022-11-19 07:24:18,376 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 5220 transitions. Word has length 15 [2022-11-19 07:24:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:18,376 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 5220 transitions. [2022-11-19 07:24:18,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 5220 transitions. [2022-11-19 07:24:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:24:18,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:18,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:18,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:18,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:18,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:18,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:18,592 INFO L85 PathProgramCache]: Analyzing trace with hash -244824679, now seen corresponding path program 1 times [2022-11-19 07:24:18,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:18,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754802532] [2022-11-19 07:24:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:18,593 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:24:18,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:18,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:18,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:18,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:24:18,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:18,825 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:24:18,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:18,825 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:24:18,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754802532] [2022-11-19 07:24:18,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754802532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:18,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:18,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:24:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197014785] [2022-11-19 07:24:18,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:18,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:24:18,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:24:18,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:24:18,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:24:18,828 INFO L87 Difference]: Start difference. First operand 1692 states and 5220 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:19,217 INFO L93 Difference]: Finished difference Result 1278 states and 3941 transitions. [2022-11-19 07:24:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:24:19,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:24:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:19,222 INFO L225 Difference]: With dead ends: 1278 [2022-11-19 07:24:19,223 INFO L226 Difference]: Without dead ends: 1152 [2022-11-19 07:24:19,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:19,223 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:19,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 64 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:24:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-11-19 07:24:19,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2022-11-19 07:24:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1150 states have (on average 3.130434782608696) internal successors, (3600), 1151 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states 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:24:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3600 transitions. [2022-11-19 07:24:19,263 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3600 transitions. Word has length 19 [2022-11-19 07:24:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:19,263 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 3600 transitions. [2022-11-19 07:24:19,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3600 transitions. [2022-11-19 07:24:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:24:19,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:19,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:19,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:19,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:19,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2022432716, now seen corresponding path program 1 times [2022-11-19 07:24:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:19,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527391416] [2022-11-19 07:24:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:19,480 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:24:19,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:19,481 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:19,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:19,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 07:24:19,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:19,775 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:24:19,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:19,776 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:24:19,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527391416] [2022-11-19 07:24:19,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527391416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:19,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:19,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:24:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379253467] [2022-11-19 07:24:19,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:19,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:24:19,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:24:19,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:24:19,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:19,779 INFO L87 Difference]: Start difference. First operand 1152 states and 3600 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:24:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:20,266 INFO L93 Difference]: Finished difference Result 1085 states and 3464 transitions. [2022-11-19 07:24:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:24:20,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-11-19 07:24:20,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:20,271 INFO L225 Difference]: With dead ends: 1085 [2022-11-19 07:24:20,271 INFO L226 Difference]: Without dead ends: 1067 [2022-11-19 07:24:20,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:24:20,272 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:20,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 96 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:24:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-11-19 07:24:20,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2022-11-19 07:24:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1065 states have (on average 3.220657276995305) internal successors, (3430), 1066 states have internal predecessors, (3430), 0 states have call successors, (0), 0 states 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:24:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3430 transitions. [2022-11-19 07:24:20,304 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 3430 transitions. Word has length 23 [2022-11-19 07:24:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:20,304 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 3430 transitions. [2022-11-19 07:24:20,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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:24:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 3430 transitions. [2022-11-19 07:24:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:24:20,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:20,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:20,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:20,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:20,520 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:20,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash -426293595, now seen corresponding path program 1 times [2022-11-19 07:24:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:20,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541134582] [2022-11-19 07:24:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:20,522 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:24:20,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:20,523 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:20,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:20,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:24:20,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:21,007 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:24:21,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:21,008 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:24:21,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541134582] [2022-11-19 07:24:21,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541134582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:21,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:21,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:24:21,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777215413] [2022-11-19 07:24:21,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:21,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:24:21,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:24:21,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:24:21,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:21,010 INFO L87 Difference]: Start difference. First operand 1067 states and 3430 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:24:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:21,410 INFO L93 Difference]: Finished difference Result 1619 states and 4973 transitions. [2022-11-19 07:24:21,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:24:21,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-19 07:24:21,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:21,422 INFO L225 Difference]: With dead ends: 1619 [2022-11-19 07:24:21,422 INFO L226 Difference]: Without dead ends: 1619 [2022-11-19 07:24:21,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:24:21,423 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 82 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:21,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 39 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:24:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2022-11-19 07:24:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1435. [2022-11-19 07:24:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1433 states have (on average 3.1360781577110957) internal successors, (4494), 1434 states have internal predecessors, (4494), 0 states have call successors, (0), 0 states 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:24:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 4494 transitions. [2022-11-19 07:24:21,499 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 4494 transitions. Word has length 28 [2022-11-19 07:24:21,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:21,499 INFO L495 AbstractCegarLoop]: Abstraction has 1435 states and 4494 transitions. [2022-11-19 07:24:21,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:24:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 4494 transitions. [2022-11-19 07:24:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:24:21,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:21,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:21,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:21,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:21,718 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:21,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1540734873, now seen corresponding path program 2 times [2022-11-19 07:24:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:21,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109995956] [2022-11-19 07:24:21,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:24:21,720 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:24:21,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:21,721 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:21,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:21,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:24:21,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:24:21,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:24:21,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:21,985 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:24:21,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:21,986 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:24:21,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109995956] [2022-11-19 07:24:21,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109995956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:21,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:21,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:24:21,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332523618] [2022-11-19 07:24:21,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:21,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:21,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:24:21,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:21,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:21,990 INFO L87 Difference]: Start difference. First operand 1435 states and 4494 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:24:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:22,176 INFO L93 Difference]: Finished difference Result 2153 states and 6651 transitions. [2022-11-19 07:24:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:24:22,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-19 07:24:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:22,186 INFO L225 Difference]: With dead ends: 2153 [2022-11-19 07:24:22,186 INFO L226 Difference]: Without dead ends: 2153 [2022-11-19 07:24:22,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:24:22,188 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:22,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2022-11-19 07:24:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1715. [2022-11-19 07:24:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1713 states have (on average 3.1710449503794513) internal successors, (5432), 1714 states have internal predecessors, (5432), 0 states have call successors, (0), 0 states 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:24:22,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 5432 transitions. [2022-11-19 07:24:22,260 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 5432 transitions. Word has length 28 [2022-11-19 07:24:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:22,260 INFO L495 AbstractCegarLoop]: Abstraction has 1715 states and 5432 transitions. [2022-11-19 07:24:22,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:24:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 5432 transitions. [2022-11-19 07:24:22,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:24:22,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:22,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:22,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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)] Ended with exit code 0 [2022-11-19 07:24:22,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:22,487 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1915924049, now seen corresponding path program 3 times [2022-11-19 07:24:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:22,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763748798] [2022-11-19 07:24:22,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:24:22,489 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:24:22,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:22,490 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:22,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:22,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:24:22,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:24:22,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:24:22,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:22,701 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:24:22,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:22,702 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:24:22,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763748798] [2022-11-19 07:24:22,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763748798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:22,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:22,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:24:22,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589425702] [2022-11-19 07:24:22,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:22,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:22,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:24:22,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:22,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:22,705 INFO L87 Difference]: Start difference. First operand 1715 states and 5432 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:24:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:22,881 INFO L93 Difference]: Finished difference Result 2345 states and 7325 transitions. [2022-11-19 07:24:22,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:24:22,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-19 07:24:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:22,892 INFO L225 Difference]: With dead ends: 2345 [2022-11-19 07:24:22,892 INFO L226 Difference]: Without dead ends: 2345 [2022-11-19 07:24:22,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:24:22,894 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:22,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 13 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2022-11-19 07:24:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1586. [2022-11-19 07:24:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1584 states have (on average 3.167929292929293) internal successors, (5018), 1585 states have internal predecessors, (5018), 0 states have call successors, (0), 0 states 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:24:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 5018 transitions. [2022-11-19 07:24:22,968 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 5018 transitions. Word has length 28 [2022-11-19 07:24:22,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:22,969 INFO L495 AbstractCegarLoop]: Abstraction has 1586 states and 5018 transitions. [2022-11-19 07:24:22,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:24:22,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 5018 transitions. [2022-11-19 07:24:22,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:24:22,977 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:22,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:22,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:23,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:23,191 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:23,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:23,192 INFO L85 PathProgramCache]: Analyzing trace with hash 818829003, now seen corresponding path program 4 times [2022-11-19 07:24:23,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:23,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43075090] [2022-11-19 07:24:23,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:24:23,193 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:24:23,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:23,194 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:23,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:23,366 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:24:23,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:24:23,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 07:24:23,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:24:23,867 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:24:23,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:24:23,868 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:24:23,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43075090] [2022-11-19 07:24:23,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43075090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:23,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:23,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:24:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447521517] [2022-11-19 07:24:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:23,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:24:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:24:23,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:24:23,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:24:23,871 INFO L87 Difference]: Start difference. First operand 1586 states and 5018 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:24:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:24,279 INFO L93 Difference]: Finished difference Result 1778 states and 5524 transitions. [2022-11-19 07:24:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:24:24,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-19 07:24:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:24,287 INFO L225 Difference]: With dead ends: 1778 [2022-11-19 07:24:24,287 INFO L226 Difference]: Without dead ends: 1778 [2022-11-19 07:24:24,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-19 07:24:24,288 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:24,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 44 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:24:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2022-11-19 07:24:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1366. [2022-11-19 07:24:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1364 states have (on average 3.196480938416422) internal successors, (4360), 1365 states have internal predecessors, (4360), 0 states have call successors, (0), 0 states 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:24:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 4360 transitions. [2022-11-19 07:24:24,343 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 4360 transitions. Word has length 28 [2022-11-19 07:24:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:24,344 INFO L495 AbstractCegarLoop]: Abstraction has 1366 states and 4360 transitions. [2022-11-19 07:24:24,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:24:24,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 4360 transitions. [2022-11-19 07:24:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 07:24:24,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:24,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:24,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:24,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:24,562 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash 39590095, now seen corresponding path program 5 times [2022-11-19 07:24:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:24:24,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038130957] [2022-11-19 07:24:24,563 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-19 07:24:24,563 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:24:24,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:24:24,564 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:24,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:24,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:24:24,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-19 07:24:24,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:24:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:24:24,997 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-19 07:24:25,014 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:24:25,016 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-19 07:24:25,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-19 07:24:25,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-19 07:24:25,020 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-19 07:24:25,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-19 07:24:25,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-19 07:24:25,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-19 07:24:25,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-19 07:24:25,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-19 07:24:25,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-19 07:24:25,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-19 07:24:25,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-19 07:24:25,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-19 07:24:25,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-19 07:24:25,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-19 07:24:25,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-19 07:24:25,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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)] Forceful destruction successful, exit code 0 [2022-11-19 07:24:25,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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:24:25,261 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:25,266 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:24:25,267 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:24:25,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:24:25 BasicIcfg [2022-11-19 07:24:25,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:24:25,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:24:25,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:24:25,432 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:24:25,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:03" (3/4) ... [2022-11-19 07:24:25,435 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:24:25,435 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:24:25,436 INFO L158 Benchmark]: Toolchain (without parser) took 23997.51ms. Allocated memory was 56.6MB in the beginning and 805.3MB in the end (delta: 748.7MB). Free memory was 34.2MB in the beginning and 380.1MB in the end (delta: -346.0MB). Peak memory consumption was 402.2MB. Max. memory is 16.1GB. [2022-11-19 07:24:25,436 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:24:25,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.41ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 33.9MB in the beginning and 47.9MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:24:25,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.28ms. Allocated memory is still 77.6MB. Free memory was 47.9MB in the beginning and 45.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:24:25,437 INFO L158 Benchmark]: Boogie Preprocessor took 35.91ms. Allocated memory is still 77.6MB. Free memory was 45.5MB in the beginning and 43.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:24:25,438 INFO L158 Benchmark]: RCFGBuilder took 1005.71ms. Allocated memory is still 77.6MB. Free memory was 43.1MB in the beginning and 47.5MB in the end (delta: -4.4MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-11-19 07:24:25,438 INFO L158 Benchmark]: TraceAbstraction took 22256.22ms. Allocated memory was 77.6MB in the beginning and 805.3MB in the end (delta: 727.7MB). Free memory was 47.0MB in the beginning and 380.1MB in the end (delta: -333.1MB). Peak memory consumption was 394.9MB. Max. memory is 16.1GB. [2022-11-19 07:24:25,438 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 805.3MB. Free memory is still 380.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:24:25,440 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.29ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 587.41ms. Allocated memory was 56.6MB in the beginning and 77.6MB in the end (delta: 21.0MB). Free memory was 33.9MB in the beginning and 47.9MB in the end (delta: -14.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.28ms. Allocated memory is still 77.6MB. Free memory was 47.9MB in the beginning and 45.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.91ms. Allocated memory is still 77.6MB. Free memory was 45.5MB in the beginning and 43.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1005.71ms. Allocated memory is still 77.6MB. Free memory was 43.1MB in the beginning and 47.5MB in the end (delta: -4.4MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22256.22ms. Allocated memory was 77.6MB in the beginning and 805.3MB in the end (delta: 727.7MB). Free memory was 47.0MB in the beginning and 380.1MB in the end (delta: -333.1MB). Peak memory consumption was 394.9MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 805.3MB. Free memory is still 380.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: 10.5s, 162 PlacesBefore, 57 PlacesAfterwards, 151 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 146 TotalNumberOfCompositions, 10967 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5570, independent: 5331, independent conditional: 0, independent unconditional: 5331, dependent: 239, dependent conditional: 0, dependent unconditional: 239, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2894, independent: 2809, independent conditional: 0, independent unconditional: 2809, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2894, independent: 2779, independent conditional: 0, independent unconditional: 2779, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 115, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 545, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 471, dependent conditional: 0, dependent unconditional: 471, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5570, independent: 2522, independent conditional: 0, independent unconditional: 2522, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 2894, unknown conditional: 0, unknown unconditional: 2894] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 367, Positive conditional cache size: 0, Positive unconditional cache size: 367, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L738] 0 _Bool a$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L722] 0 int a$mem_tmp; [L733] 0 _Bool a$read_delayed; [L712] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L731] 0 _Bool a$r_buff1_thd3; [L714] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$r_buff1_thd1; [L735] 0 int a$w_buff0; [L730] 0 _Bool a$r_buff1_thd2; [L737] 0 int a$w_buff1; [L721] 0 _Bool a$flush_delayed; [L728] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L734] 0 int *a$read_delayed_var; [L740] 0 _Bool main$tmp_guard1; [L739] 0 _Bool main$tmp_guard0; [L736] 0 _Bool a$w_buff0_used; [L724] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd0; [L716] 0 int __unbuffered_p3_EAX = 0; [L726] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd4; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L866] 0 pthread_t t465; [L867] FCALL, FORK 0 pthread_create(&t465, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t465, ((void *)0), P0, ((void *)0))=-1, t465={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t466; [L869] FCALL, FORK 0 pthread_create(&t466, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t466, ((void *)0), P1, ((void *)0))=0, t465={11:0}, t466={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L870] 0 pthread_t t467; [L871] FCALL, FORK 0 pthread_create(&t467, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t467, ((void *)0), P2, ((void *)0))=1, t465={11:0}, t466={15:0}, t467={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L872] 0 pthread_t t468; [L873] FCALL, FORK 0 pthread_create(&t468, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t468, ((void *)0), P3, ((void *)0))=2, t465={11:0}, t466={15:0}, t467={7:0}, t468={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L805] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L822] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L825] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t465={11:0}, t466={15:0}, t467={7:0}, t468={-2147483637:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] [L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 188 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 21.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 505 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 340 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1823 IncrementalHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 104 mSDtfsCounter, 1823 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 1793 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1022 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1527 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-19 07:24:25,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00257d1f-9aa9-4af7-8f6e-feedf4b0420d/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