./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:30:17,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:30:17,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:30:17,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:30:17,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:30:17,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:30:17,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:30:17,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:30:17,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:30:17,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:30:17,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:30:17,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:30:17,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:30:17,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:30:17,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:30:17,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:30:17,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:30:17,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:30:17,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:30:17,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:30:17,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:30:17,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:30:17,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:30:17,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:30:17,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:30:17,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:30:17,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:30:17,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:30:17,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:30:17,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:30:17,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:30:17,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:30:17,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:30:17,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:30:17,404 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:30:17,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:30:17,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:30:17,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:30:17,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:30:17,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:30:17,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:30:17,409 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-03 04:30:17,459 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:30:17,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:30:17,461 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:30:17,467 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:30:17,467 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:30:17,468 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:30:17,468 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:30:17,468 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:30:17,468 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:30:17,469 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:30:17,470 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:30:17,470 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:30:17,470 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:30:17,471 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:30:17,471 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:30:17,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 04:30:17,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 04:30:17,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:30:17,472 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:30:17,472 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 04:30:17,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:30:17,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:30:17,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:30:17,473 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 04:30:17,474 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 04:30:17,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:30:17,475 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:30:17,476 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:30:17,476 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:30:17,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:30:17,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:30:17,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:30:17,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:30:17,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:30:17,478 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:30:17,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:30:17,478 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:30:17,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:30:17,478 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH 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-memcleanup) ) 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 -> 820401b0140b0bfb9dffe62418c7fb9ec2170c8bc6edd71581a88d2ffbcfa1c6 [2021-11-03 04:30:17,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:30:17,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:30:17,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:30:17,765 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:30:17,766 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:30:17,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/forester-heap/dll-token-2.i [2021-11-03 04:30:17,844 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/data/465e78c89/69c6049bc59b482ea6c654422ed26cc0/FLAGc44e2dc0f [2021-11-03 04:30:18,411 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:30:18,412 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i [2021-11-03 04:30:18,428 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/data/465e78c89/69c6049bc59b482ea6c654422ed26cc0/FLAGc44e2dc0f [2021-11-03 04:30:18,741 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/data/465e78c89/69c6049bc59b482ea6c654422ed26cc0 [2021-11-03 04:30:18,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:30:18,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:30:18,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:30:18,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:30:18,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:30:18,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:30:18" (1/1) ... [2021-11-03 04:30:18,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb20c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:18, skipping insertion in model container [2021-11-03 04:30:18,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:30:18" (1/1) ... [2021-11-03 04:30:18,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:30:18,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:30:19,262 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22229,22242] [2021-11-03 04:30:19,278 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22398,22411] [2021-11-03 04:30:19,281 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22489,22502] [2021-11-03 04:30:19,285 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22571,22584] [2021-11-03 04:30:19,286 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22649,22662] [2021-11-03 04:30:19,289 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22795,22808] [2021-11-03 04:30:19,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:30:19,314 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:30:19,360 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22229,22242] [2021-11-03 04:30:19,362 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22398,22411] [2021-11-03 04:30:19,363 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22489,22502] [2021-11-03 04:30:19,365 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22571,22584] [2021-11-03 04:30:19,366 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22649,22662] [2021-11-03 04:30:19,368 WARN L228 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_f0fa6b8f-e523-4c81-9b4c-926a4d307575/sv-benchmarks/c/forester-heap/dll-token-2.i[22795,22808] [2021-11-03 04:30:19,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:30:19,400 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:30:19,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19 WrapperNode [2021-11-03 04:30:19,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:30:19,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:30:19,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:30:19,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:30:19,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (1/1) ... [2021-11-03 04:30:19,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (1/1) ... [2021-11-03 04:30:19,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:30:19,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:30:19,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:30:19,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:30:19,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (1/1) ... [2021-11-03 04:30:19,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (1/1) ... [2021-11-03 04:30:19,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (1/1) ... [2021-11-03 04:30:19,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (1/1) ... [2021-11-03 04:30:19,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (1/1) ... [2021-11-03 04:30:19,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (1/1) ... [2021-11-03 04:30:19,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (1/1) ... [2021-11-03 04:30:19,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:30:19,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:30:19,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:30:19,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:30:19,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (1/1) ... [2021-11-03 04:30:19,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:30:19,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:30:19,576 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:30:19,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:30:19,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 04:30:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 04:30:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 04:30:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 04:30:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:30:19,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 04:30:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 04:30:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:30:19,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:30:19,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:30:20,233 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:30:20,233 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-11-03 04:30:20,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:30:20 BoogieIcfgContainer [2021-11-03 04:30:20,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:30:20,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:30:20,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:30:20,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:30:20,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:30:18" (1/3) ... [2021-11-03 04:30:20,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6004d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:30:20, skipping insertion in model container [2021-11-03 04:30:20,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:30:19" (2/3) ... [2021-11-03 04:30:20,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6004d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:30:20, skipping insertion in model container [2021-11-03 04:30:20,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:30:20" (3/3) ... [2021-11-03 04:30:20,248 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2021-11-03 04:30:20,254 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:30:20,255 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2021-11-03 04:30:20,315 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:30:20,324 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 04:30:20,325 INFO L340 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2021-11-03 04:30:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 58 states have (on average 2.5172413793103448) internal successors, (146), 122 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-03 04:30:20,355 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:20,356 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-03 04:30:20,356 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:20,367 INFO L85 PathProgramCache]: Analyzing trace with hash 8839, now seen corresponding path program 1 times [2021-11-03 04:30:20,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:20,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494544650] [2021-11-03 04:30:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:20,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:20,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:20,568 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:20,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494544650] [2021-11-03 04:30:20,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494544650] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:20,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:20,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 04:30:20,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615417613] [2021-11-03 04:30:20,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:30:20,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:20,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:30:20,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:30:20,619 INFO L87 Difference]: Start difference. First operand has 123 states, 58 states have (on average 2.5172413793103448) internal successors, (146), 122 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:20,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:20,812 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2021-11-03 04:30:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:30:20,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-11-03 04:30:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:20,828 INFO L225 Difference]: With dead ends: 140 [2021-11-03 04:30:20,828 INFO L226 Difference]: Without dead ends: 139 [2021-11-03 04:30:20,831 INFO L786 BasicCegarLoop]: 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 [2021-11-03 04:30:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-03 04:30:20,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2021-11-03 04:30:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 58 states have (on average 2.086206896551724) internal successors, (121), 118 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2021-11-03 04:30:20,871 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 2 [2021-11-03 04:30:20,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:20,872 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2021-11-03 04:30:20,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2021-11-03 04:30:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-03 04:30:20,873 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:20,873 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-03 04:30:20,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:30:20,874 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash 8840, now seen corresponding path program 1 times [2021-11-03 04:30:20,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:20,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055776900] [2021-11-03 04:30:20,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:20,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:20,924 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:20,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055776900] [2021-11-03 04:30:20,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055776900] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:20,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:20,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 04:30:20,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831399265] [2021-11-03 04:30:20,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:30:20,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:20,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:30:20,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:30:20,928 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:21,022 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2021-11-03 04:30:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:30:21,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-11-03 04:30:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:21,024 INFO L225 Difference]: With dead ends: 144 [2021-11-03 04:30:21,024 INFO L226 Difference]: Without dead ends: 144 [2021-11-03 04:30:21,025 INFO L786 BasicCegarLoop]: 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 [2021-11-03 04:30:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-03 04:30:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2021-11-03 04:30:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 58 states have (on average 2.0344827586206895) internal successors, (118), 115 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2021-11-03 04:30:21,035 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 2 [2021-11-03 04:30:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:21,035 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2021-11-03 04:30:21,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,036 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2021-11-03 04:30:21,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 04:30:21,036 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:21,037 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:21,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:30:21,037 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:21,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:21,038 INFO L85 PathProgramCache]: Analyzing trace with hash -365389701, now seen corresponding path program 1 times [2021-11-03 04:30:21,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:21,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925131891] [2021-11-03 04:30:21,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:21,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:21,141 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:21,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925131891] [2021-11-03 04:30:21,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925131891] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:21,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:21,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:30:21,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252291340] [2021-11-03 04:30:21,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:30:21,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:21,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:30:21,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:30:21,144 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:21,449 INFO L93 Difference]: Finished difference Result 219 states and 223 transitions. [2021-11-03 04:30:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:30:21,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-03 04:30:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:21,456 INFO L225 Difference]: With dead ends: 219 [2021-11-03 04:30:21,456 INFO L226 Difference]: Without dead ends: 219 [2021-11-03 04:30:21,457 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:30:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-11-03 04:30:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 149. [2021-11-03 04:30:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.978021978021978) internal successors, (180), 148 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 180 transitions. [2021-11-03 04:30:21,482 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 180 transitions. Word has length 7 [2021-11-03 04:30:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:21,482 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 180 transitions. [2021-11-03 04:30:21,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 180 transitions. [2021-11-03 04:30:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-03 04:30:21,484 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:21,484 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:21,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:30:21,484 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:21,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:21,485 INFO L85 PathProgramCache]: Analyzing trace with hash -365389702, now seen corresponding path program 1 times [2021-11-03 04:30:21,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:21,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409824482] [2021-11-03 04:30:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:21,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:21,539 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:21,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409824482] [2021-11-03 04:30:21,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409824482] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:21,540 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:21,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:30:21,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394199863] [2021-11-03 04:30:21,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:30:21,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:21,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:30:21,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:30:21,542 INFO L87 Difference]: Start difference. First operand 149 states and 180 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:21,681 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2021-11-03 04:30:21,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:30:21,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-03 04:30:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:21,683 INFO L225 Difference]: With dead ends: 139 [2021-11-03 04:30:21,684 INFO L226 Difference]: Without dead ends: 139 [2021-11-03 04:30:21,684 INFO L786 BasicCegarLoop]: 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 [2021-11-03 04:30:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-11-03 04:30:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2021-11-03 04:30:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.6373626373626373) internal successors, (149), 133 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2021-11-03 04:30:21,692 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 7 [2021-11-03 04:30:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:21,693 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2021-11-03 04:30:21,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2021-11-03 04:30:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-03 04:30:21,694 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:21,694 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:21,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 04:30:21,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:21,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1048061535, now seen corresponding path program 1 times [2021-11-03 04:30:21,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:21,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392552555] [2021-11-03 04:30:21,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:21,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:21,781 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:21,782 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392552555] [2021-11-03 04:30:21,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392552555] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:21,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:21,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:30:21,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399684042] [2021-11-03 04:30:21,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:30:21,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:21,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:30:21,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:30:21,785 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:21,955 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2021-11-03 04:30:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:30:21,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-03 04:30:21,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:21,957 INFO L225 Difference]: With dead ends: 133 [2021-11-03 04:30:21,957 INFO L226 Difference]: Without dead ends: 133 [2021-11-03 04:30:21,957 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:30:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-11-03 04:30:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-11-03 04:30:21,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 91 states have (on average 1.6153846153846154) internal successors, (147), 132 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 147 transitions. [2021-11-03 04:30:21,962 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 147 transitions. Word has length 9 [2021-11-03 04:30:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:21,963 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 147 transitions. [2021-11-03 04:30:21,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:21,963 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2021-11-03 04:30:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-03 04:30:21,964 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:21,964 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:21,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 04:30:21,964 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:21,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:21,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1048061534, now seen corresponding path program 1 times [2021-11-03 04:30:21,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:21,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037166004] [2021-11-03 04:30:21,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:21,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:22,014 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:22,014 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037166004] [2021-11-03 04:30:22,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037166004] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:22,015 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:22,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:30:22,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113461529] [2021-11-03 04:30:22,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:30:22,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:22,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:30:22,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:30:22,017 INFO L87 Difference]: Start difference. First operand 133 states and 147 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:22,151 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2021-11-03 04:30:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:30:22,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-03 04:30:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:22,153 INFO L225 Difference]: With dead ends: 132 [2021-11-03 04:30:22,153 INFO L226 Difference]: Without dead ends: 132 [2021-11-03 04:30:22,154 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:30:22,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-11-03 04:30:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-11-03 04:30:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 91 states have (on average 1.5934065934065933) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2021-11-03 04:30:22,159 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 9 [2021-11-03 04:30:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:22,159 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2021-11-03 04:30:22,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2021-11-03 04:30:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 04:30:22,160 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:22,160 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:22,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 04:30:22,161 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:22,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1871606420, now seen corresponding path program 1 times [2021-11-03 04:30:22,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:22,162 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116955057] [2021-11-03 04:30:22,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:22,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:22,231 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:22,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116955057] [2021-11-03 04:30:22,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116955057] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:22,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:22,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:30:22,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395699027] [2021-11-03 04:30:22,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:30:22,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:22,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:30:22,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:30:22,237 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:22,364 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2021-11-03 04:30:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:30:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-03 04:30:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:22,367 INFO L225 Difference]: With dead ends: 131 [2021-11-03 04:30:22,367 INFO L226 Difference]: Without dead ends: 131 [2021-11-03 04:30:22,368 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:30:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-11-03 04:30:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-11-03 04:30:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 91 states have (on average 1.5714285714285714) internal successors, (143), 130 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:22,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2021-11-03 04:30:22,372 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 10 [2021-11-03 04:30:22,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:22,373 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2021-11-03 04:30:22,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:22,373 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2021-11-03 04:30:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 04:30:22,374 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:22,374 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:22,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 04:30:22,375 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:22,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1871606419, now seen corresponding path program 1 times [2021-11-03 04:30:22,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:22,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601338151] [2021-11-03 04:30:22,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:22,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:22,469 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:22,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601338151] [2021-11-03 04:30:22,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601338151] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:22,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:22,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:30:22,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805359162] [2021-11-03 04:30:22,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:30:22,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:22,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:30:22,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:30:22,472 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:22,605 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2021-11-03 04:30:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:30:22,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-03 04:30:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:22,606 INFO L225 Difference]: With dead ends: 130 [2021-11-03 04:30:22,606 INFO L226 Difference]: Without dead ends: 130 [2021-11-03 04:30:22,607 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:30:22,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-03 04:30:22,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-11-03 04:30:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 91 states have (on average 1.5494505494505495) internal successors, (141), 129 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2021-11-03 04:30:22,611 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 10 [2021-11-03 04:30:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:22,611 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2021-11-03 04:30:22,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2021-11-03 04:30:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 04:30:22,613 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:22,613 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:22,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 04:30:22,616 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:22,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2129952249, now seen corresponding path program 1 times [2021-11-03 04:30:22,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:22,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886941267] [2021-11-03 04:30:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:22,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:22,765 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:22,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886941267] [2021-11-03 04:30:22,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886941267] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:22,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:22,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 04:30:22,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37894979] [2021-11-03 04:30:22,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 04:30:22,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:22,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 04:30:22,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-03 04:30:22,775 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2021-11-03 04:30:23,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:23,059 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2021-11-03 04:30:23,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:30:23,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 [2021-11-03 04:30:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:23,060 INFO L225 Difference]: With dead ends: 134 [2021-11-03 04:30:23,060 INFO L226 Difference]: Without dead ends: 134 [2021-11-03 04:30:23,061 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 04:30:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-11-03 04:30:23,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2021-11-03 04:30:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 128 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2021-11-03 04:30:23,064 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 11 [2021-11-03 04:30:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:23,064 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2021-11-03 04:30:23,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2021-11-03 04:30:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2021-11-03 04:30:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 04:30:23,065 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:23,065 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:23,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 04:30:23,065 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:23,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2129952248, now seen corresponding path program 1 times [2021-11-03 04:30:23,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:23,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148004659] [2021-11-03 04:30:23,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:23,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:23,223 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:23,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148004659] [2021-11-03 04:30:23,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148004659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:23,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:23,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 04:30:23,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006457996] [2021-11-03 04:30:23,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 04:30:23,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:23,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 04:30:23,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:30:23,231 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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) [2021-11-03 04:30:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:23,724 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2021-11-03 04:30:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-03 04:30:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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 [2021-11-03 04:30:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:23,726 INFO L225 Difference]: With dead ends: 129 [2021-11-03 04:30:23,726 INFO L226 Difference]: Without dead ends: 129 [2021-11-03 04:30:23,727 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-11-03 04:30:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-11-03 04:30:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 110. [2021-11-03 04:30:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.5) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-11-03 04:30:23,730 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 11 [2021-11-03 04:30:23,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:23,730 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-11-03 04:30:23,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 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) [2021-11-03 04:30:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-11-03 04:30:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 04:30:23,731 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:23,731 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:23,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 04:30:23,731 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:23,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash 977701891, now seen corresponding path program 1 times [2021-11-03 04:30:23,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:23,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076511939] [2021-11-03 04:30:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:23,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:23,798 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:23,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076511939] [2021-11-03 04:30:23,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076511939] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:23,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:23,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 04:30:23,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516844297] [2021-11-03 04:30:23,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:30:23,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:23,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:30:23,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:30:23,800 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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) [2021-11-03 04:30:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:23,996 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2021-11-03 04:30:23,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:30:23,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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 [2021-11-03 04:30:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:23,997 INFO L225 Difference]: With dead ends: 109 [2021-11-03 04:30:23,997 INFO L226 Difference]: Without dead ends: 109 [2021-11-03 04:30:23,998 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:30:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-03 04:30:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-03 04:30:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.4875) internal successors, (119), 108 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2021-11-03 04:30:24,008 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 12 [2021-11-03 04:30:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:24,008 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2021-11-03 04:30:24,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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) [2021-11-03 04:30:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2021-11-03 04:30:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 04:30:24,009 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:24,009 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:24,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 04:30:24,010 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:24,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:24,012 INFO L85 PathProgramCache]: Analyzing trace with hash 977701892, now seen corresponding path program 1 times [2021-11-03 04:30:24,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:24,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165865182] [2021-11-03 04:30:24,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:24,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:24,131 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:24,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165865182] [2021-11-03 04:30:24,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165865182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:24,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:24,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 04:30:24,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324249314] [2021-11-03 04:30:24,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 04:30:24,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:24,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 04:30:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-03 04:30:24,138 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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) [2021-11-03 04:30:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:24,278 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2021-11-03 04:30:24,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 04:30:24,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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 [2021-11-03 04:30:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:24,280 INFO L225 Difference]: With dead ends: 108 [2021-11-03 04:30:24,280 INFO L226 Difference]: Without dead ends: 108 [2021-11-03 04:30:24,280 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:30:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-11-03 04:30:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-11-03 04:30:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 80 states have (on average 1.475) internal successors, (118), 107 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2021-11-03 04:30:24,283 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 12 [2021-11-03 04:30:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:24,283 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2021-11-03 04:30:24,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 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) [2021-11-03 04:30:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2021-11-03 04:30:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 04:30:24,284 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:24,284 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:24,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 04:30:24,284 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:24,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:24,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1815289415, now seen corresponding path program 1 times [2021-11-03 04:30:24,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:24,285 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593374734] [2021-11-03 04:30:24,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:24,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:24,377 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:24,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593374734] [2021-11-03 04:30:24,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593374734] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:24,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:24,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-03 04:30:24,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297220776] [2021-11-03 04:30:24,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 04:30:24,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 04:30:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:30:24,380 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) [2021-11-03 04:30:24,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:24,761 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2021-11-03 04:30:24,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 04:30:24,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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 [2021-11-03 04:30:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:24,763 INFO L225 Difference]: With dead ends: 123 [2021-11-03 04:30:24,763 INFO L226 Difference]: Without dead ends: 123 [2021-11-03 04:30:24,763 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-11-03 04:30:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-03 04:30:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2021-11-03 04:30:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2021-11-03 04:30:24,766 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 13 [2021-11-03 04:30:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:24,766 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2021-11-03 04:30:24,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 9 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) [2021-11-03 04:30:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2021-11-03 04:30:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 04:30:24,767 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:24,767 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:24,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 04:30:24,767 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:24,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1026143783, now seen corresponding path program 1 times [2021-11-03 04:30:24,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:24,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318881563] [2021-11-03 04:30:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:24,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:24,797 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:24,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318881563] [2021-11-03 04:30:24,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318881563] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:24,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:24,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:30:24,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971479951] [2021-11-03 04:30:24,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:30:24,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:24,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:30:24,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:30:24,799 INFO L87 Difference]: Start difference. First operand 106 states and 116 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) [2021-11-03 04:30:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:24,892 INFO L93 Difference]: Finished difference Result 159 states and 164 transitions. [2021-11-03 04:30:24,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:30:24,893 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 [2021-11-03 04:30:24,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:24,894 INFO L225 Difference]: With dead ends: 159 [2021-11-03 04:30:24,894 INFO L226 Difference]: Without dead ends: 159 [2021-11-03 04:30:24,895 INFO L786 BasicCegarLoop]: 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 [2021-11-03 04:30:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-11-03 04:30:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 104. [2021-11-03 04:30:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 103 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2021-11-03 04:30:24,898 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 14 [2021-11-03 04:30:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:24,898 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2021-11-03 04:30:24,898 INFO L471 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) [2021-11-03 04:30:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2021-11-03 04:30:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-03 04:30:24,899 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:24,899 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:24,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 04:30:24,900 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2088902450, now seen corresponding path program 1 times [2021-11-03 04:30:24,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:24,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357637994] [2021-11-03 04:30:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:24,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:25,267 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:25,267 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357637994] [2021-11-03 04:30:25,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357637994] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:25,267 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:25,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-03 04:30:25,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611180967] [2021-11-03 04:30:25,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-03 04:30:25,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:25,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-03 04:30:25,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-03 04:30:25,271 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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) [2021-11-03 04:30:25,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:25,825 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2021-11-03 04:30:25,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 04:30:25,826 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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 [2021-11-03 04:30:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:25,827 INFO L225 Difference]: With dead ends: 144 [2021-11-03 04:30:25,827 INFO L226 Difference]: Without dead ends: 144 [2021-11-03 04:30:25,828 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-11-03 04:30:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-11-03 04:30:25,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2021-11-03 04:30:25,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 117 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2021-11-03 04:30:25,831 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 19 [2021-11-03 04:30:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:25,831 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2021-11-03 04:30:25,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 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) [2021-11-03 04:30:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2021-11-03 04:30:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-03 04:30:25,832 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:25,832 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:25,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 04:30:25,833 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:25,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:25,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2088869679, now seen corresponding path program 1 times [2021-11-03 04:30:25,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:25,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398521313] [2021-11-03 04:30:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:25,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:25,870 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:25,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398521313] [2021-11-03 04:30:25,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398521313] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:25,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:25,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 04:30:25,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563651797] [2021-11-03 04:30:25,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 04:30:25,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:25,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 04:30:25,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:30:25,871 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 5 states, 5 states have (on average 3.8) 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) [2021-11-03 04:30:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:25,970 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2021-11-03 04:30:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 04:30:25,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) 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 [2021-11-03 04:30:25,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:25,972 INFO L225 Difference]: With dead ends: 116 [2021-11-03 04:30:25,972 INFO L226 Difference]: Without dead ends: 116 [2021-11-03 04:30:25,972 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 04:30:25,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-03 04:30:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2021-11-03 04:30:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 115 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2021-11-03 04:30:25,975 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 19 [2021-11-03 04:30:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:25,975 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2021-11-03 04:30:25,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) 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) [2021-11-03 04:30:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2021-11-03 04:30:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-03 04:30:25,977 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:25,977 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:25,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 04:30:25,977 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:25,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1685661151, now seen corresponding path program 1 times [2021-11-03 04:30:25,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:25,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590557059] [2021-11-03 04:30:25,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:25,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:26,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:26,158 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:26,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590557059] [2021-11-03 04:30:26,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590557059] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-03 04:30:26,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343208704] [2021-11-03 04:30:26,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:26,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-03 04:30:26,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:30:26,159 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-03 04:30:26,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-03 04:30:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:26,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-03 04:30:26,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 04:30:26,443 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-03 04:30:26,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-03 04:30:26,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-11-03 04:30:26,588 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-11-03 04:30:26,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2021-11-03 04:30:26,744 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-11-03 04:30:26,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 53 [2021-11-03 04:30:26,898 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-11-03 04:30:26,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2021-11-03 04:30:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:26,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 04:30:27,007 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:27,011 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-11-03 04:30:27,019 INFO L354 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2021-11-03 04:30:27,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-03 04:30:39,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3970 treesize of output 3906 [2021-11-03 04:30:39,861 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-03 04:30:39,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [367640718] [2021-11-03 04:30:39,886 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2021-11-03 04:30:39,886 INFO L166 IcfgInterpreter]: Building call graph [2021-11-03 04:30:39,891 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-03 04:30:39,895 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-03 04:30:39,896 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-03 04:30:39,942 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:39,944 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:39,945 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:39,946 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-11-03 04:30:39,948 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:39,948 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:39,949 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-11-03 04:30:39,950 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 131 [2021-11-03 04:30:39,966 INFO L446 ElimStorePlain]: Different costs {0=[|v_#length_88|], 21=[|v_#valid_103|]} [2021-11-03 04:30:39,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:39,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:39,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:39,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-11-03 04:30:39,978 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:39,979 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-03 04:30:39,979 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:39,980 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-11-03 04:30:39,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:39,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:39,994 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:39,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:39,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2021-11-03 04:30:40,025 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,028 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-11-03 04:30:40,029 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,030 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-11-03 04:30:40,030 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,047 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,048 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,049 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2021-11-03 04:30:40,050 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,050 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:111 [2021-11-03 04:30:40,056 INFO L180 QuantifierPusher]: treesize reduction 3, result has 98.1 percent of original size [2021-11-03 04:30:40,075 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,083 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,083 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-11-03 04:30:40,084 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,084 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,085 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-11-03 04:30:40,086 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,086 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,087 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-11-03 04:30:40,088 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 159 [2021-11-03 04:30:40,097 INFO L446 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_71|, |v_#memory_$Pointer$.offset_68|], 6=[|v_#memory_int_61|]} [2021-11-03 04:30:40,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-03 04:30:40,105 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,106 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-03 04:30:40,106 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,107 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-03 04:30:40,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,113 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-03 04:30:40,121 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,121 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-03 04:30:40,122 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,122 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-11-03 04:30:40,123 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,128 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2021-11-03 04:30:40,138 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,140 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,141 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,142 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,142 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,147 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,150 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,152 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 132 [2021-11-03 04:30:40,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,153 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:155, output treesize:132 [2021-11-03 04:30:40,159 INFO L180 QuantifierPusher]: treesize reduction 12, result has 93.7 percent of original size [2021-11-03 04:30:40,160 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,160 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,161 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-03 04:30:40,161 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,162 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,162 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-11-03 04:30:40,163 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,163 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,164 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-03 04:30:40,166 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 183 [2021-11-03 04:30:40,169 INFO L446 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_72|, |v_#memory_$Pointer$.offset_69|], 6=[|v_#memory_int_62|]} [2021-11-03 04:30:40,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 04:30:40,179 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,180 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,180 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,181 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,181 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,187 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-11-03 04:30:40,200 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,201 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,202 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,202 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,202 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,209 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-03 04:30:40,218 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,220 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,220 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,221 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,221 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,227 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,228 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,230 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 150 [2021-11-03 04:30:40,230 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,231 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:177, output treesize:150 [2021-11-03 04:30:40,237 INFO L180 QuantifierPusher]: treesize reduction 12, result has 94.5 percent of original size [2021-11-03 04:30:40,238 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,238 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,239 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-03 04:30:40,239 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,246 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,246 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-11-03 04:30:40,247 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,248 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,248 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-03 04:30:40,251 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 213 [2021-11-03 04:30:40,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-03 04:30:40,265 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,266 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-03 04:30:40,267 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,267 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-03 04:30:40,267 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,275 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-03 04:30:40,288 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,289 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,289 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,290 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,290 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-03 04:30:40,308 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,310 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,311 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,311 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,312 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,318 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,320 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,322 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2021-11-03 04:30:40,323 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,323 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:207, output treesize:165 [2021-11-03 04:30:40,332 INFO L180 QuantifierPusher]: treesize reduction 8, result has 95.5 percent of original size [2021-11-03 04:30:40,336 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2021-11-03 04:30:40,342 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,344 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,344 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,345 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-11-03 04:30:40,345 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,346 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,346 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-03 04:30:40,347 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,347 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,348 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-03 04:30:40,348 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,349 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,349 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-11-03 04:30:40,350 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,351 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,351 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-11-03 04:30:40,354 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 270 [2021-11-03 04:30:40,359 INFO L446 ElimStorePlain]: Different costs {10=[|v_#length_89|], 21=[|v_#valid_104|]} [2021-11-03 04:30:40,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,386 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-03 04:30:40,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2021-11-03 04:30:40,388 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,390 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-11-03 04:30:40,390 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,391 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-11-03 04:30:40,391 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,401 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,456 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-11-03 04:30:40,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 45 [2021-11-03 04:30:40,457 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,460 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-11-03 04:30:40,461 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,461 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-11-03 04:30:40,461 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,473 INFO L446 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_74|, |v_#memory_$Pointer$.offset_71|], 12=[|v_#memory_int_64|]} [2021-11-03 04:30:40,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-03 04:30:40,490 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,491 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,494 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,499 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,499 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,517 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2021-11-03 04:30:40,530 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,531 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,532 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,532 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,532 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-03 04:30:40,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2021-11-03 04:30:40,553 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,555 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-03 04:30:40,556 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,556 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-03 04:30:40,556 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,568 INFO L180 QuantifierPusher]: treesize reduction 3, result has 98.4 percent of original size [2021-11-03 04:30:40,572 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 190 [2021-11-03 04:30:40,573 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,573 INFO L247 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:260, output treesize:190 [2021-11-03 04:30:40,580 INFO L180 QuantifierPusher]: treesize reduction 5, result has 97.9 percent of original size [2021-11-03 04:30:40,581 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,582 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,582 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-11-03 04:30:40,583 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,583 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,584 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-11-03 04:30:40,585 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,587 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,587 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,588 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,588 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-11-03 04:30:40,589 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-11-03 04:30:40,589 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,589 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,590 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,591 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,591 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-11-03 04:30:40,592 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-11-03 04:30:40,592 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,593 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,593 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-11-03 04:30:40,596 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 240 [2021-11-03 04:30:40,601 INFO L446 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_75|, |v_#memory_$Pointer$.offset_72|], 12=[|v_#memory_int_65|]} [2021-11-03 04:30:40,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-03 04:30:40,613 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,615 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,615 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,616 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,616 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,625 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-11-03 04:30:40,636 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,638 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,639 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,639 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-11-03 04:30:40,639 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2021-11-03 04:30:40,660 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,662 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-03 04:30:40,662 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,663 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-03 04:30:40,663 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,671 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,674 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,677 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 210 [2021-11-03 04:30:40,678 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,678 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:234, output treesize:210 [2021-11-03 04:30:40,687 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,696 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,697 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,698 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,698 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,699 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-11-03 04:30:40,700 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-11-03 04:30:40,700 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,701 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,703 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,703 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,705 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 130 [2021-11-03 04:30:40,705 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 131 [2021-11-03 04:30:40,706 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,706 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,707 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,708 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,709 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 164 [2021-11-03 04:30:40,709 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2021-11-03 04:30:40,710 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,711 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,712 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 214 [2021-11-03 04:30:40,714 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 334 [2021-11-03 04:30:40,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 107 [2021-11-03 04:30:40,732 INFO L180 QuantifierPusher]: treesize reduction 5, result has 95.4 percent of original size [2021-11-03 04:30:40,734 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2021-11-03 04:30:40,734 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,735 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2021-11-03 04:30:40,735 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-03 04:30:40,768 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-11-03 04:30:40,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 78 [2021-11-03 04:30:40,770 INFO L180 QuantifierPusher]: treesize reduction 5, result has 93.7 percent of original size [2021-11-03 04:30:40,777 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 100 [2021-11-03 04:30:40,778 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,778 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 100 [2021-11-03 04:30:40,779 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,797 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2021-11-03 04:30:40,809 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,812 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-03 04:30:40,813 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,813 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-11-03 04:30:40,814 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,822 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,824 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,827 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 232 [2021-11-03 04:30:40,827 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,828 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:332, output treesize:232 [2021-11-03 04:30:40,837 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,855 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,856 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,856 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,857 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,857 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-11-03 04:30:40,858 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-11-03 04:30:40,858 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,859 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,861 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,862 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,862 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 146 [2021-11-03 04:30:40,863 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 147 [2021-11-03 04:30:40,863 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,864 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,865 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,865 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,866 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 191 [2021-11-03 04:30:40,867 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 192 [2021-11-03 04:30:40,868 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-11-03 04:30:40,869 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,870 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 232 [2021-11-03 04:30:40,873 INFO L185 QuantifierPusher]: treesize reduction 6, result has 98.3 percent of original size 341 [2021-11-03 04:30:40,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,890 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-03 04:30:40,895 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-03 04:30:40,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 191 treesize of output 139 [2021-11-03 04:30:40,896 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,899 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-11-03 04:30:40,899 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,900 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-11-03 04:30:40,900 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,909 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,931 INFO L354 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2021-11-03 04:30:40,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 95 [2021-11-03 04:30:40,932 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,934 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-11-03 04:30:40,935 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,935 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-11-03 04:30:40,936 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-03 04:30:40,957 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2021-11-03 04:30:40,958 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,959 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-11-03 04:30:40,960 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,960 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-11-03 04:30:40,961 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-03 04:30:40,978 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:40,981 INFO L180 QuantifierPusher]: treesize reduction 6, result has 97.7 percent of original size [2021-11-03 04:30:40,984 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 253 [2021-11-03 04:30:40,984 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-11-03 04:30:40,985 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:345, output treesize:253 [2021-11-03 04:30:41,002 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:41,008 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 289 [2021-11-03 04:30:41,014 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:41,018 INFO L185 QuantifierPusher]: treesize reduction 10, result has 96.6 percent of original size 288 [2021-11-03 04:30:41,024 INFO L180 QuantifierPusher]: treesize reduction 22, result has 93.2 percent of original size [2021-11-03 04:30:41,033 INFO L185 QuantifierPusher]: treesize reduction 288, result has 0.3 percent of original size 1 [2021-11-03 04:30:41,043 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-11-03 04:30:41,047 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 289 [2021-11-03 04:30:41,054 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-03 04:30:44,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [367640718] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:44,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-03 04:30:44,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 23 [2021-11-03 04:30:44,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119336661] [2021-11-03 04:30:44,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-03 04:30:44,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:44,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-03 04:30:44,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1001, Unknown=6, NotChecked=0, Total=1260 [2021-11-03 04:30:44,502 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:44,898 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2021-11-03 04:30:44,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-03 04:30:44,899 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-03 04:30:44,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:44,900 INFO L225 Difference]: With dead ends: 124 [2021-11-03 04:30:44,900 INFO L226 Difference]: Without dead ends: 124 [2021-11-03 04:30:44,901 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=253, Invalid=1001, Unknown=6, NotChecked=0, Total=1260 [2021-11-03 04:30:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-11-03 04:30:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 114. [2021-11-03 04:30:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 113 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2021-11-03 04:30:44,948 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 21 [2021-11-03 04:30:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:44,948 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2021-11-03 04:30:44,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2021-11-03 04:30:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-03 04:30:44,949 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:44,949 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:45,012 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-03 04:30:45,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-03 04:30:45,150 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:45,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:45,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1654168128, now seen corresponding path program 1 times [2021-11-03 04:30:45,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:45,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676735669] [2021-11-03 04:30:45,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:45,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:45,301 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:45,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676735669] [2021-11-03 04:30:45,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676735669] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:45,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:45,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 04:30:45,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265723703] [2021-11-03 04:30:45,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 04:30:45,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:45,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 04:30:45,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:30:45,303 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:45,581 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2021-11-03 04:30:45,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 04:30:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-03 04:30:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:45,583 INFO L225 Difference]: With dead ends: 137 [2021-11-03 04:30:45,583 INFO L226 Difference]: Without dead ends: 137 [2021-11-03 04:30:45,583 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-11-03 04:30:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-11-03 04:30:45,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2021-11-03 04:30:45,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2021-11-03 04:30:45,586 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 21 [2021-11-03 04:30:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:45,586 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2021-11-03 04:30:45,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2021-11-03 04:30:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-03 04:30:45,587 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:45,587 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:45,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-03 04:30:45,587 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1654168129, now seen corresponding path program 1 times [2021-11-03 04:30:45,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:45,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480991496] [2021-11-03 04:30:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:45,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:30:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:30:45,775 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:30:45,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480991496] [2021-11-03 04:30:45,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480991496] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:30:45,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:30:45,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 04:30:45,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969528510] [2021-11-03 04:30:45,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 04:30:45,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:30:45,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 04:30:45,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-03 04:30:45,778 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:30:46,064 INFO L93 Difference]: Finished difference Result 141 states and 145 transitions. [2021-11-03 04:30:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 04:30:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-03 04:30:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:30:46,065 INFO L225 Difference]: With dead ends: 141 [2021-11-03 04:30:46,065 INFO L226 Difference]: Without dead ends: 141 [2021-11-03 04:30:46,066 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-11-03 04:30:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-11-03 04:30:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2021-11-03 04:30:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.372340425531915) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2021-11-03 04:30:46,068 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 21 [2021-11-03 04:30:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:30:46,069 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2021-11-03 04:30:46,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:30:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2021-11-03 04:30:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-03 04:30:46,070 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:30:46,070 INFO L513 BasicCegarLoop]: 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] [2021-11-03 04:30:46,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-03 04:30:46,070 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 60 more)] === [2021-11-03 04:30:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:30:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash 517676064, now seen corresponding path program 1 times [2021-11-03 04:30:46,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:30:46,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910737613] [2021-11-03 04:30:46,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:30:46,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:30:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:30:46,115 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 04:30:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:30:46,169 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 04:30:46,169 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 04:30:46,170 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 04:30:46,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-03 04:30:46,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-03 04:30:46,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-03 04:30:46,172 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-03 04:30:46,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-03 04:30:46,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-03 04:30:46,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-03 04:30:46,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-03 04:30:46,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-03 04:30:46,173 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-03 04:30:46,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-03 04:30:46,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-03 04:30:46,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-03 04:30:46,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-03 04:30:46,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-03 04:30:46,174 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-03 04:30:46,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 04:30:46,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-03 04:30:46,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-03 04:30:46,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-03 04:30:46,175 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-03 04:30:46,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-03 04:30:46,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-03 04:30:46,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-03 04:30:46,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-03 04:30:46,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-03 04:30:46,176 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-03 04:30:46,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-03 04:30:46,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-03 04:30:46,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 04:30:46,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-03 04:30:46,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-03 04:30:46,177 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-11-03 04:30:46,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-03 04:30:46,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 04:30:46,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-11-03 04:30:46,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-03 04:30:46,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-03 04:30:46,178 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-03 04:30:46,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 04:30:46,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-03 04:30:46,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-03 04:30:46,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-03 04:30:46,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-03 04:30:46,179 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-11-03 04:30:46,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-03 04:30:46,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-03 04:30:46,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-03 04:30:46,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:30:46,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:30:46,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:30:46,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-11-03 04:30:46,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-11-03 04:30:46,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 04:30:46,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-11-03 04:30:46,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-11-03 04:30:46,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:30:46,182 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:30:46,182 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:30:46,182 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:30:46,182 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:30:46,182 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 04:30:46,183 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 04:30:46,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-03 04:30:46,186 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:30:46,190 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 04:30:46,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:30:46 BoogieIcfgContainer [2021-11-03 04:30:46,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 04:30:46,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 04:30:46,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 04:30:46,215 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 04:30:46,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:30:20" (3/4) ... [2021-11-03 04:30:46,217 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-03 04:30:46,251 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 04:30:46,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 04:30:46,253 INFO L168 Benchmark]: Toolchain (without parser) took 27506.89 ms. Allocated memory was 100.7 MB in the beginning and 127.9 MB in the end (delta: 27.3 MB). Free memory was 62.6 MB in the beginning and 85.0 MB in the end (delta: -22.5 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. [2021-11-03 04:30:46,253 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 100.7 MB. Free memory was 80.7 MB in the beginning and 80.7 MB in the end (delta: 61.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:30:46,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.51 ms. Allocated memory is still 100.7 MB. Free memory was 62.4 MB in the beginning and 69.7 MB in the end (delta: -7.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-03 04:30:46,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.71 ms. Allocated memory is still 100.7 MB. Free memory was 69.7 MB in the beginning and 67.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:30:46,254 INFO L168 Benchmark]: Boogie Preprocessor took 54.87 ms. Allocated memory is still 100.7 MB. Free memory was 67.7 MB in the beginning and 65.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:30:46,254 INFO L168 Benchmark]: RCFGBuilder took 704.14 ms. Allocated memory is still 100.7 MB. Free memory was 65.9 MB in the beginning and 42.4 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:30:46,255 INFO L168 Benchmark]: TraceAbstraction took 25976.28 ms. Allocated memory was 100.7 MB in the beginning and 127.9 MB in the end (delta: 27.3 MB). Free memory was 42.1 MB in the beginning and 87.2 MB in the end (delta: -45.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:30:46,255 INFO L168 Benchmark]: Witness Printer took 37.09 ms. Allocated memory is still 127.9 MB. Free memory was 87.2 MB in the beginning and 85.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 04:30:46,257 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.27 ms. Allocated memory is still 100.7 MB. Free memory was 80.7 MB in the beginning and 80.7 MB in the end (delta: 61.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 654.51 ms. Allocated memory is still 100.7 MB. Free memory was 62.4 MB in the beginning and 69.7 MB in the end (delta: -7.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.71 ms. Allocated memory is still 100.7 MB. Free memory was 69.7 MB in the beginning and 67.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.87 ms. Allocated memory is still 100.7 MB. Free memory was 67.7 MB in the beginning and 65.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 704.14 ms. Allocated memory is still 100.7 MB. Free memory was 65.9 MB in the beginning and 42.4 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 25976.28 ms. Allocated memory was 100.7 MB in the beginning and 127.9 MB in the end (delta: 27.3 MB). Free memory was 42.1 MB in the beginning and 87.2 MB in the end (delta: -45.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 37.09 ms. Allocated memory is still 127.9 MB. Free memory was 87.2 MB in the beginning and 85.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1037]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1004] SLL* head = malloc(sizeof(SLL)); [L1005] head->next = ((void*)0) [L1006] head->prev = ((void*)0) [L1007] head->data = 0 [L1009] SLL* x = head; [L1012] COND FALSE !(__VERIFIER_nondet_int()) [L1021] x->data = 1 [L1022] x->next = malloc(sizeof(SLL)) [L1023] EXPR x->next [L1023] x->next->prev = x [L1024] EXPR x->next [L1024] x->next->data = 2 [L1026] x = head [L1028] COND FALSE !(!(((void*)0) != x)) [L1030] EXPR x->data [L1030] COND FALSE !(1 != x->data) [L1035] EXPR x->data [L1035] COND FALSE !(!(1 == x->data)) [L1036] EXPR x->next [L1036] x = x->next [L1037] EXPR x->data [L1037] COND TRUE !(2 != x->data) [L1037] reach_error() - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1006]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 64 error locations. Started 1 CEGAR loops. OverallTime: 25.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1228 SDtfs, 1651 SDslu, 2419 SDs, 0 SdLazy, 3866 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 215 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=3, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 295 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 1992 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 0/1 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: OVERALL_TIME[ms]: 1168, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 17, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 23, TOOLS_POST_TIME[ms]: 1071, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 23, TOOLS_QUANTIFIERELIM_TIME[ms]: 1061, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 234, FLUID_QUERY_TIME[ms]: 6, FLUID_QUERIES: 44, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME[ms]: 0, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME[ms]: 0, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME[ms]: 2, DOMAIN_ISBOTTOM_APPLICATIONS: 17, DOMAIN_ISBOTTOM_TIME[ms]: 35, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 44, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 44, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 2, PATH_EXPR_TIME[ms]: 3, REGEX_TO_DAG_TIME[ms]: 6, DAG_COMPRESSION_TIME[ms]: 19, DAG_COMPRESSION_PROCESSED_NODES: 288, DAG_COMPRESSION_RETAINED_NODES: 54, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-03 04:30:46,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f0fa6b8f-e523-4c81-9b4c-926a4d307575/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)