./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW --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 f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 15:40:53,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:40:53,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:40:53,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:40:53,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:40:53,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:40:53,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:40:53,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:40:53,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:40:53,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:40:53,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:40:53,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:40:53,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:40:53,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:40:53,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:40:53,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:40:53,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:40:53,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:40:53,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:40:53,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:40:53,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:40:53,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:40:53,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:40:53,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:40:53,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:40:53,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:40:53,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:40:53,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:40:53,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:40:53,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:40:53,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:40:53,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:40:53,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:40:53,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:40:53,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:40:53,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:40:53,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:40:53,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:40:53,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:40:53,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:40:53,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:40:53,853 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-23 15:40:53,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:40:53,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:40:53,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:40:53,879 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:40:53,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:40:53,880 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:40:53,880 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:40:53,881 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:40:53,881 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:40:53,882 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:40:53,882 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:40:53,882 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:40:53,882 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:40:53,883 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:40:53,883 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:40:53,883 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:40:53,884 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:40:53,884 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:40:53,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 15:40:53,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 15:40:53,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:40:53,886 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:40:53,886 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:40:53,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:40:53,887 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:40:53,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:40:53,888 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 15:40:53,888 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 15:40:53,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:40:53,889 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:40:53,889 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:40:53,889 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:40:53,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:40:53,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:40:53,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:40:53,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:40:53,891 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:40:53,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:40:53,891 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:40:53,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:40:53,892 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:40:53,892 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/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_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW 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 -> f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e [2022-11-23 15:40:54,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:40:54,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:40:54,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:40:54,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:40:54,206 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:40:54,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/forester-heap/sll-circular-2.i [2022-11-23 15:40:57,337 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:40:57,701 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:40:57,706 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/sv-benchmarks/c/forester-heap/sll-circular-2.i [2022-11-23 15:40:57,726 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/data/c4383896e/e2c56e2284b54a94a50ea04bb4e237c3/FLAG98e1102d6 [2022-11-23 15:40:57,743 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/data/c4383896e/e2c56e2284b54a94a50ea04bb4e237c3 [2022-11-23 15:40:57,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:40:57,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:40:57,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:40:57,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:40:57,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:40:57,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:40:57" (1/1) ... [2022-11-23 15:40:57,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69a7577c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:57, skipping insertion in model container [2022-11-23 15:40:57,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:40:57" (1/1) ... [2022-11-23 15:40:57,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:40:57,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:40:58,240 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2022-11-23 15:40:58,247 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2022-11-23 15:40:58,251 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2022-11-23 15:40:58,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:40:58,280 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:40:58,334 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2022-11-23 15:40:58,351 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2022-11-23 15:40:58,358 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2022-11-23 15:40:58,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:40:58,400 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:40:58,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58 WrapperNode [2022-11-23 15:40:58,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:40:58,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:40:58,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:40:58,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:40:58,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,465 INFO L138 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2022-11-23 15:40:58,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:40:58,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:40:58,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:40:58,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:40:58,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,498 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:40:58,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:40:58,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:40:58,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:40:58,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (1/1) ... [2022-11-23 15:40:58,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:40:58,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:40:58,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:40:58,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:40:58,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 15:40:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 15:40:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 15:40:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:40:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 15:40:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 15:40:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:40:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:40:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:40:58,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:40:58,828 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:40:58,830 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:40:59,344 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:40:59,393 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:40:59,394 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-23 15:40:59,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:40:59 BoogieIcfgContainer [2022-11-23 15:40:59,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:40:59,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:40:59,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:40:59,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:40:59,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:40:57" (1/3) ... [2022-11-23 15:40:59,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1086eb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:40:59, skipping insertion in model container [2022-11-23 15:40:59,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:40:58" (2/3) ... [2022-11-23 15:40:59,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1086eb19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:40:59, skipping insertion in model container [2022-11-23 15:40:59,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:40:59" (3/3) ... [2022-11-23 15:40:59,409 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2022-11-23 15:40:59,433 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:40:59,433 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-11-23 15:40:59,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:40:59,499 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4981cfd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:40:59,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-23 15:40:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 43 states have (on average 2.511627906976744) internal successors, (108), 89 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:40:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-23 15:40:59,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:40:59,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-23 15:40:59,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:40:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:40:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash 7320, now seen corresponding path program 1 times [2022-11-23 15:40:59,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:40:59,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997038435] [2022-11-23 15:40:59,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:40:59,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:40:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:40:59,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:40:59,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:40:59,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997038435] [2022-11-23 15:40:59,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997038435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:40:59,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:40:59,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:40:59,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327762781] [2022-11-23 15:40:59,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:40:59,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:40:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:40:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:40:59,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:40:59,840 INFO L87 Difference]: Start difference. First operand has 90 states, 43 states have (on average 2.511627906976744) internal successors, (108), 89 states have internal predecessors, (108), 0 states have call successors, (0), 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) [2022-11-23 15:40:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:40:59,972 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-11-23 15:40:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:40:59,976 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 [2022-11-23 15:40:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:40:59,985 INFO L225 Difference]: With dead ends: 96 [2022-11-23 15:40:59,985 INFO L226 Difference]: Without dead ends: 95 [2022-11-23 15:40:59,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:40:59,996 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 77 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:40:59,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 61 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:41:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-23 15:41:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-11-23 15:41:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 43 states have (on average 2.116279069767442) internal successors, (91), 84 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-11-23 15:41:00,039 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 2 [2022-11-23 15:41:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:00,039 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-11-23 15:41:00,039 INFO L496 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) [2022-11-23 15:41:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-11-23 15:41:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-23 15:41:00,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:00,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-23 15:41:00,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:41:00,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:00,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:00,042 INFO L85 PathProgramCache]: Analyzing trace with hash 7321, now seen corresponding path program 1 times [2022-11-23 15:41:00,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:00,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124135858] [2022-11-23 15:41:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:00,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:00,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:00,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124135858] [2022-11-23 15:41:00,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124135858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:00,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:00,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:41:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028473504] [2022-11-23 15:41:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:00,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:41:00,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:00,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:41:00,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:41:00,210 INFO L87 Difference]: Start difference. First operand 85 states and 91 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) [2022-11-23 15:41:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:00,312 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-11-23 15:41:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:41:00,313 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 [2022-11-23 15:41:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:00,314 INFO L225 Difference]: With dead ends: 93 [2022-11-23 15:41:00,314 INFO L226 Difference]: Without dead ends: 93 [2022-11-23 15:41:00,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:41:00,316 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:00,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 64 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:41:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-23 15:41:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-11-23 15:41:00,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-11-23 15:41:00,326 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 2 [2022-11-23 15:41:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:00,326 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-11-23 15:41:00,326 INFO L496 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) [2022-11-23 15:41:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-11-23 15:41:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 15:41:00,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:00,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 15:41:00,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:41:00,328 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1824801511, now seen corresponding path program 1 times [2022-11-23 15:41:00,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:00,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077201717] [2022-11-23 15:41:00,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:00,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:00,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:00,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077201717] [2022-11-23 15:41:00,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077201717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:00,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:00,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:41:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789396135] [2022-11-23 15:41:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:00,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:41:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:41:00,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:41:00,424 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:00,601 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-11-23 15:41:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:41:00,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-23 15:41:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:00,607 INFO L225 Difference]: With dead ends: 79 [2022-11-23 15:41:00,607 INFO L226 Difference]: Without dead ends: 79 [2022-11-23 15:41:00,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:41:00,614 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 120 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:00,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 41 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:41:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-23 15:41:00,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-11-23 15:41:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-11-23 15:41:00,625 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 6 [2022-11-23 15:41:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:00,626 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-11-23 15:41:00,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-11-23 15:41:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 15:41:00,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:00,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 15:41:00,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:41:00,628 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:00,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:00,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1824801510, now seen corresponding path program 1 times [2022-11-23 15:41:00,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:00,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696305516] [2022-11-23 15:41:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:00,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:00,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696305516] [2022-11-23 15:41:00,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696305516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:00,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:00,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:41:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281423562] [2022-11-23 15:41:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:00,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:41:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:41:00,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:41:00,782 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:00,939 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2022-11-23 15:41:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:41:00,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-23 15:41:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:00,941 INFO L225 Difference]: With dead ends: 87 [2022-11-23 15:41:00,941 INFO L226 Difference]: Without dead ends: 87 [2022-11-23 15:41:00,941 INFO L412 NwaCegarLoop]: 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 [2022-11-23 15:41:00,943 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 73 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:00,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 80 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:41:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-23 15:41:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2022-11-23 15:41:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 74 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-11-23 15:41:00,949 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 6 [2022-11-23 15:41:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:00,950 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-11-23 15:41:00,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:00,950 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-11-23 15:41:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 15:41:00,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:00,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:00,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:41:00,951 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1287407321, now seen corresponding path program 1 times [2022-11-23 15:41:00,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:00,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092935854] [2022-11-23 15:41:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:00,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:01,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092935854] [2022-11-23 15:41:01,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092935854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:01,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:01,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:41:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815617965] [2022-11-23 15:41:01,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:01,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:41:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:01,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:41:01,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:41:01,221 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:01,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:01,385 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-11-23 15:41:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:41:01,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-23 15:41:01,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:01,387 INFO L225 Difference]: With dead ends: 74 [2022-11-23 15:41:01,387 INFO L226 Difference]: Without dead ends: 74 [2022-11-23 15:41:01,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:41:01,388 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:01,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 106 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:41:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-23 15:41:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-23 15:41:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.6875) internal successors, (81), 73 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-11-23 15:41:01,394 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 8 [2022-11-23 15:41:01,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:01,394 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-11-23 15:41:01,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-11-23 15:41:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 15:41:01,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:01,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:01,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:41:01,396 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1287407320, now seen corresponding path program 1 times [2022-11-23 15:41:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:01,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675021552] [2022-11-23 15:41:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:01,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:01,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:01,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675021552] [2022-11-23 15:41:01,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675021552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:01,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:01,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:41:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929704500] [2022-11-23 15:41:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:01,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:41:01,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:01,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:41:01,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:41:01,677 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:01,845 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-23 15:41:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:41:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-23 15:41:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:01,847 INFO L225 Difference]: With dead ends: 70 [2022-11-23 15:41:01,847 INFO L226 Difference]: Without dead ends: 70 [2022-11-23 15:41:01,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:41:01,849 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:01,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 151 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:41:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-23 15:41:01,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-11-23 15:41:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.627906976744186) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-23 15:41:01,859 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2022-11-23 15:41:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:01,859 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-23 15:41:01,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-23 15:41:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 15:41:01,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:01,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:01,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:41:01,860 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:01,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:01,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1260581677, now seen corresponding path program 1 times [2022-11-23 15:41:01,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:01,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815750584] [2022-11-23 15:41:01,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:01,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:02,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:02,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815750584] [2022-11-23 15:41:02,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815750584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:02,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:02,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:41:02,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475584270] [2022-11-23 15:41:02,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:02,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:41:02,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:02,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:41:02,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:41:02,210 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:02,467 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-11-23 15:41:02,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:41:02,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 15:41:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:02,469 INFO L225 Difference]: With dead ends: 144 [2022-11-23 15:41:02,469 INFO L226 Difference]: Without dead ends: 144 [2022-11-23 15:41:02,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:41:02,470 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 174 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:02,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 227 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:41:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-23 15:41:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 69. [2022-11-23 15:41:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-11-23 15:41:02,476 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 9 [2022-11-23 15:41:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:02,476 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-11-23 15:41:02,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-11-23 15:41:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:41:02,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:02,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:02,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:41:02,478 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -423322160, now seen corresponding path program 1 times [2022-11-23 15:41:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:02,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719224794] [2022-11-23 15:41:02,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:02,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:02,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:02,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719224794] [2022-11-23 15:41:02,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719224794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:02,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:02,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:41:02,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606909143] [2022-11-23 15:41:02,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:02,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:41:02,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:02,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:41:02,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:41:02,680 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:02,894 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-11-23 15:41:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:41:02,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 15:41:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:02,895 INFO L225 Difference]: With dead ends: 105 [2022-11-23 15:41:02,895 INFO L226 Difference]: Without dead ends: 105 [2022-11-23 15:41:02,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:41:02,896 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 263 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:02,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 81 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:41:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-23 15:41:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2022-11-23 15:41:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 83 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2022-11-23 15:41:02,902 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 10 [2022-11-23 15:41:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:02,902 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2022-11-23 15:41:02,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:02,903 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2022-11-23 15:41:02,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:41:02,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:02,903 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:02,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 15:41:02,904 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:02,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:02,905 INFO L85 PathProgramCache]: Analyzing trace with hash -423322159, now seen corresponding path program 1 times [2022-11-23 15:41:02,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:02,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367177265] [2022-11-23 15:41:02,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:02,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:03,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:03,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:03,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367177265] [2022-11-23 15:41:03,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367177265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:03,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:03,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:41:03,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775533544] [2022-11-23 15:41:03,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:03,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:41:03,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:03,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:41:03,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:41:03,225 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:03,447 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-11-23 15:41:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:41:03,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-23 15:41:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:03,448 INFO L225 Difference]: With dead ends: 118 [2022-11-23 15:41:03,448 INFO L226 Difference]: Without dead ends: 118 [2022-11-23 15:41:03,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:41:03,449 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 248 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:03,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 103 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:41:03,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-23 15:41:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2022-11-23 15:41:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 90 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2022-11-23 15:41:03,454 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 10 [2022-11-23 15:41:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:03,454 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2022-11-23 15:41:03,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2022-11-23 15:41:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 15:41:03,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:03,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:03,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 15:41:03,456 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:03,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1806268972, now seen corresponding path program 1 times [2022-11-23 15:41:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:03,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109236837] [2022-11-23 15:41:03,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:03,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109236837] [2022-11-23 15:41:03,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109236837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:03,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:03,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:41:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710288705] [2022-11-23 15:41:03,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:03,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:41:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:03,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:41:03,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:41:03,551 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:03,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:03,662 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2022-11-23 15:41:03,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:41:03,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 15:41:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:03,663 INFO L225 Difference]: With dead ends: 91 [2022-11-23 15:41:03,663 INFO L226 Difference]: Without dead ends: 91 [2022-11-23 15:41:03,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:41:03,664 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:03,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 175 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:41:03,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-23 15:41:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-11-23 15:41:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 88 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2022-11-23 15:41:03,669 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 12 [2022-11-23 15:41:03,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:03,669 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2022-11-23 15:41:03,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:03,670 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2022-11-23 15:41:03,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:41:03,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:03,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:03,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 15:41:03,671 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:03,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:03,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1166409919, now seen corresponding path program 1 times [2022-11-23 15:41:03,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:03,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191674073] [2022-11-23 15:41:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:03,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:04,097 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:04,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191674073] [2022-11-23 15:41:04,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191674073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:04,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:04,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:41:04,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675748430] [2022-11-23 15:41:04,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:04,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:41:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:04,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:41:04,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:41:04,100 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:04,440 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2022-11-23 15:41:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:41:04,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 15:41:04,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:04,442 INFO L225 Difference]: With dead ends: 119 [2022-11-23 15:41:04,442 INFO L226 Difference]: Without dead ends: 119 [2022-11-23 15:41:04,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:41:04,443 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 178 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:04,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 188 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:41:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-23 15:41:04,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2022-11-23 15:41:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.5555555555555556) internal successors, (112), 91 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2022-11-23 15:41:04,447 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 13 [2022-11-23 15:41:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:04,448 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2022-11-23 15:41:04,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-11-23 15:41:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:41:04,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:04,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:04,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 15:41:04,449 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1166409918, now seen corresponding path program 1 times [2022-11-23 15:41:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:04,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927018431] [2022-11-23 15:41:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:04,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:04,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:04,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927018431] [2022-11-23 15:41:04,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927018431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:04,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:04,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:41:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535020539] [2022-11-23 15:41:04,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:04,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:41:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:04,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:41:04,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:41:04,955 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:05,316 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2022-11-23 15:41:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:41:05,317 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 15:41:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:05,317 INFO L225 Difference]: With dead ends: 131 [2022-11-23 15:41:05,317 INFO L226 Difference]: Without dead ends: 131 [2022-11-23 15:41:05,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:41:05,318 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 148 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:05,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 183 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:41:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-23 15:41:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 92. [2022-11-23 15:41:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 91 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2022-11-23 15:41:05,323 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 13 [2022-11-23 15:41:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:05,323 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2022-11-23 15:41:05,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-11-23 15:41:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 15:41:05,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:05,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:05,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 15:41:05,325 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:05,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2136007192, now seen corresponding path program 1 times [2022-11-23 15:41:05,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:05,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488747941] [2022-11-23 15:41:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:05,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:05,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:05,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488747941] [2022-11-23 15:41:05,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488747941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:05,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:05,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:41:05,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616984119] [2022-11-23 15:41:05,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:05,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:41:05,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:05,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:41:05,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:41:05,374 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:05,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:05,427 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2022-11-23 15:41:05,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:41:05,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 15:41:05,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:05,430 INFO L225 Difference]: With dead ends: 150 [2022-11-23 15:41:05,430 INFO L226 Difference]: Without dead ends: 150 [2022-11-23 15:41:05,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:41:05,432 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:05,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 105 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:41:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-23 15:41:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 102. [2022-11-23 15:41:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.5) internal successors, (123), 101 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-11-23 15:41:05,439 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 15 [2022-11-23 15:41:05,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:05,440 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-11-23 15:41:05,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-11-23 15:41:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 15:41:05,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:05,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:05,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 15:41:05,446 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:05,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2084441583, now seen corresponding path program 1 times [2022-11-23 15:41:05,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:05,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310843824] [2022-11-23 15:41:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:05,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:05,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:05,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310843824] [2022-11-23 15:41:05,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310843824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:05,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:05,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:41:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268049514] [2022-11-23 15:41:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:05,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:41:05,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:41:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:41:05,702 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:05,908 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-11-23 15:41:05,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:41:05,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 15:41:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:05,909 INFO L225 Difference]: With dead ends: 141 [2022-11-23 15:41:05,909 INFO L226 Difference]: Without dead ends: 141 [2022-11-23 15:41:05,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:41:05,910 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 238 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:05,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 145 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:41:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-23 15:41:05,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-11-23 15:41:05,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 104 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) [2022-11-23 15:41:05,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2022-11-23 15:41:05,914 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 16 [2022-11-23 15:41:05,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:05,914 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2022-11-23 15:41:05,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2022-11-23 15:41:05,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 15:41:05,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:05,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:05,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 15:41:05,916 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2065219022, now seen corresponding path program 1 times [2022-11-23 15:41:05,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:05,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013779271] [2022-11-23 15:41:05,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:05,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:06,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:06,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013779271] [2022-11-23 15:41:06,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013779271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:06,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:06,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 15:41:06,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620918372] [2022-11-23 15:41:06,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:06,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 15:41:06,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:06,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 15:41:06,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:41:06,494 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:07,015 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-11-23 15:41:07,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 15:41:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 15:41:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:07,016 INFO L225 Difference]: With dead ends: 120 [2022-11-23 15:41:07,016 INFO L226 Difference]: Without dead ends: 120 [2022-11-23 15:41:07,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-23 15:41:07,018 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 152 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:07,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 252 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 15:41:07,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-23 15:41:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2022-11-23 15:41:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 104 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2022-11-23 15:41:07,021 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 16 [2022-11-23 15:41:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:07,022 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2022-11-23 15:41:07,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2022-11-23 15:41:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 15:41:07,023 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:07,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:07,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 15:41:07,023 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash 193251577, now seen corresponding path program 1 times [2022-11-23 15:41:07,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:07,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341895553] [2022-11-23 15:41:07,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:07,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:07,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341895553] [2022-11-23 15:41:07,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341895553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:07,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:07,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:41:07,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569839987] [2022-11-23 15:41:07,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:07,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:41:07,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:07,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:41:07,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:41:07,300 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:07,556 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-11-23 15:41:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:41:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 15:41:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:07,557 INFO L225 Difference]: With dead ends: 146 [2022-11-23 15:41:07,558 INFO L226 Difference]: Without dead ends: 146 [2022-11-23 15:41:07,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:41:07,559 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 244 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:07,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 202 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:41:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-23 15:41:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2022-11-23 15:41:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 107 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-11-23 15:41:07,563 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 17 [2022-11-23 15:41:07,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:07,563 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-11-23 15:41:07,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:07,563 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-11-23 15:41:07,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 15:41:07,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:07,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:07,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 15:41:07,565 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:07,566 INFO L85 PathProgramCache]: Analyzing trace with hash -403091939, now seen corresponding path program 1 times [2022-11-23 15:41:07,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:07,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688370865] [2022-11-23 15:41:07,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:07,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:07,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:07,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:07,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688370865] [2022-11-23 15:41:07,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688370865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:07,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:07,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:41:07,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424144947] [2022-11-23 15:41:07,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:07,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:41:07,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:07,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:41:07,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:41:07,871 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:08,200 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2022-11-23 15:41:08,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:41:08,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 15:41:08,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:08,201 INFO L225 Difference]: With dead ends: 128 [2022-11-23 15:41:08,201 INFO L226 Difference]: Without dead ends: 128 [2022-11-23 15:41:08,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-23 15:41:08,202 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 192 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:08,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 186 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:41:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-23 15:41:08,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 112. [2022-11-23 15:41:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-11-23 15:41:08,208 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 17 [2022-11-23 15:41:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:08,209 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-11-23 15:41:08,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:08,209 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-11-23 15:41:08,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 15:41:08,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:08,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:08,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 15:41:08,210 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:08,211 INFO L85 PathProgramCache]: Analyzing trace with hash -403091938, now seen corresponding path program 1 times [2022-11-23 15:41:08,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:08,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347588421] [2022-11-23 15:41:08,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:08,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:08,658 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:08,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347588421] [2022-11-23 15:41:08,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347588421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:08,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:08,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:41:08,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716512329] [2022-11-23 15:41:08,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:08,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:41:08,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:08,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:41:08,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:41:08,661 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:08,935 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2022-11-23 15:41:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:41:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 15:41:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:08,937 INFO L225 Difference]: With dead ends: 139 [2022-11-23 15:41:08,937 INFO L226 Difference]: Without dead ends: 139 [2022-11-23 15:41:08,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:41:08,938 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 178 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:08,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 150 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:41:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-23 15:41:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2022-11-23 15:41:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.434782608695652) internal successors, (132), 111 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2022-11-23 15:41:08,941 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 17 [2022-11-23 15:41:08,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:08,942 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2022-11-23 15:41:08,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2022-11-23 15:41:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 15:41:08,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:08,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:08,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 15:41:08,943 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:08,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:08,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1693608402, now seen corresponding path program 1 times [2022-11-23 15:41:08,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:08,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289510425] [2022-11-23 15:41:08,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:08,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:09,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:09,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289510425] [2022-11-23 15:41:09,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289510425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:09,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:09,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:41:09,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874633721] [2022-11-23 15:41:09,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:09,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:41:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:09,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:41:09,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:41:09,199 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:09,464 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2022-11-23 15:41:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:41:09,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 15:41:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:09,466 INFO L225 Difference]: With dead ends: 126 [2022-11-23 15:41:09,466 INFO L226 Difference]: Without dead ends: 122 [2022-11-23 15:41:09,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:41:09,467 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 141 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:09,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 199 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:41:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-23 15:41:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-11-23 15:41:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 109 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) [2022-11-23 15:41:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2022-11-23 15:41:09,471 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 18 [2022-11-23 15:41:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:09,471 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2022-11-23 15:41:09,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2022-11-23 15:41:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 15:41:09,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:09,472 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:09,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 15:41:09,472 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:09,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:09,472 INFO L85 PathProgramCache]: Analyzing trace with hash 303022428, now seen corresponding path program 1 times [2022-11-23 15:41:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:09,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901912660] [2022-11-23 15:41:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:09,792 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:09,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901912660] [2022-11-23 15:41:09,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901912660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:41:09,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229928005] [2022-11-23 15:41:09,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:09,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:41:09,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:41:09,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:41:09,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 15:41:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:09,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-23 15:41:09,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:41:10,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-23 15:41:10,183 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:41:10,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2022-11-23 15:41:10,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-23 15:41:10,344 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:41:10,345 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-23 15:41:10,384 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:41:10,385 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-23 15:41:10,456 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:41:10,457 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 28 [2022-11-23 15:41:10,498 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 12 [2022-11-23 15:41:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:10,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:41:10,523 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_451 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-23 15:41:10,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:41:10,637 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-23 15:41:10,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:41:10,651 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 36 [2022-11-23 15:41:10,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 18 [2022-11-23 15:41:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-23 15:41:10,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229928005] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:41:10,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1438997661] [2022-11-23 15:41:10,889 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-23 15:41:10,890 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:41:10,894 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:41:10,901 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:41:10,901 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:41:10,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:10,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:10,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-11-23 15:41:11,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,007 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 21 [2022-11-23 15:41:11,021 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:41:11,028 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:41:11,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,065 INFO L350 Elim1Store]: Elim1 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 30 [2022-11-23 15:41:11,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,104 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 11 [2022-11-23 15:41:11,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,123 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 11 [2022-11-23 15:41:11,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-23 15:41:11,239 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-23 15:41:11,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,264 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-23 15:41:11,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 15:41:11,351 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 15:41:11,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 47 [2022-11-23 15:41:11,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-23 15:41:11,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,406 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 33 [2022-11-23 15:41:11,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,469 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 24 [2022-11-23 15:41:11,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,487 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 21 [2022-11-23 15:41:11,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,510 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 42 [2022-11-23 15:41:11,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2022-11-23 15:41:11,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,680 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 21 [2022-11-23 15:41:11,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,696 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 21 [2022-11-23 15:41:11,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2022-11-23 15:41:11,840 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-11-23 15:41:11,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 120 [2022-11-23 15:41:11,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,875 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 35 [2022-11-23 15:41:11,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:11,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2022-11-23 15:41:12,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:12,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:12,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:41:12,159 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-23 15:41:12,160 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 364 [2022-11-23 15:41:12,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:12,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:12,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:41:12,195 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-23 15:41:12,195 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 459 treesize of output 437 [2022-11-23 15:41:12,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:12,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:12,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:12,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:12,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:41:12,282 INFO L321 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-11-23 15:41:12,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 453 treesize of output 455 [2022-11-23 15:41:12,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:12,697 INFO L321 Elim1Store]: treesize reduction 278, result has 12.0 percent of original size [2022-11-23 15:41:12,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 461 treesize of output 468 [2022-11-23 15:41:12,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:41:12,972 INFO L321 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2022-11-23 15:41:12,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 555 treesize of output 440 [2022-11-23 15:41:13,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:13,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:13,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:13,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:13,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:41:13,132 INFO L321 Elim1Store]: treesize reduction 170, result has 17.1 percent of original size [2022-11-23 15:41:13,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 504 treesize of output 490 [2022-11-23 15:41:13,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:41:13,211 INFO L321 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2022-11-23 15:41:13,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 491 treesize of output 477 [2022-11-23 15:41:13,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:41:13,768 INFO L321 Elim1Store]: treesize reduction 176, result has 15.8 percent of original size [2022-11-23 15:41:13,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 812 treesize of output 506 [2022-11-23 15:41:13,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:41:13,961 INFO L321 Elim1Store]: treesize reduction 188, result has 17.9 percent of original size [2022-11-23 15:41:13,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 823 treesize of output 721 [2022-11-23 15:41:14,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:14,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:41:14,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:41:14,248 INFO L321 Elim1Store]: treesize reduction 424, result has 12.9 percent of original size [2022-11-23 15:41:14,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 760 treesize of output 741 [2022-11-23 15:41:14,584 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:41:14,590 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:41:14,598 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:41:14,629 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 15:41:14,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 15:41:14,662 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 15:41:14,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 15:41:14,678 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-23 15:41:14,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-23 15:41:14,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2022-11-23 15:41:14,828 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-11-23 15:41:14,829 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 173 [2022-11-23 15:41:14,911 INFO L321 Elim1Store]: treesize reduction 60, result has 39.4 percent of original size [2022-11-23 15:41:14,912 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 162 [2022-11-23 15:41:14,995 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-11-23 15:41:14,996 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 145 [2022-11-23 15:41:15,284 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:41:15,289 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:41:15,295 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:41:15,338 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:41:15,344 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:41:15,351 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:41:15,411 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 15:41:15,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 15:41:15,451 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 15:41:15,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 15:41:15,482 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-23 15:41:15,488 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 1 [2022-11-23 15:41:15,494 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-23 15:41:15,504 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:41:16,426 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4303#(and (= |ULTIMATE.start_main_~state~0#1| 1) (<= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_85| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (and (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_71|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_85|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_85|) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_85|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_71|)) |ULTIMATE.start_main_~state~0#1|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-23 15:41:16,426 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:41:16,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:41:16,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2022-11-23 15:41:16,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414001529] [2022-11-23 15:41:16,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:41:16,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 15:41:16,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:16,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 15:41:16,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=881, Unknown=5, NotChecked=60, Total=1056 [2022-11-23 15:41:16,429 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:17,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:17,540 INFO L93 Difference]: Finished difference Result 213 states and 234 transitions. [2022-11-23 15:41:17,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 15:41:17,541 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 15:41:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:17,543 INFO L225 Difference]: With dead ends: 213 [2022-11-23 15:41:17,543 INFO L226 Difference]: Without dead ends: 213 [2022-11-23 15:41:17,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=208, Invalid=1424, Unknown=12, NotChecked=78, Total=1722 [2022-11-23 15:41:17,544 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 360 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:17,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 537 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 725 Invalid, 3 Unknown, 134 Unchecked, 0.7s Time] [2022-11-23 15:41:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-23 15:41:17,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 128. [2022-11-23 15:41:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 127 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2022-11-23 15:41:17,550 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 18 [2022-11-23 15:41:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:17,551 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2022-11-23 15:41:17,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2022-11-23 15:41:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 15:41:17,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:17,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:17,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 15:41:17,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:41:17,759 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:17,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1031178538, now seen corresponding path program 1 times [2022-11-23 15:41:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:17,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381091538] [2022-11-23 15:41:17,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:17,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:41:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:41:18,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:41:18,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381091538] [2022-11-23 15:41:18,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381091538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:41:18,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:41:18,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-23 15:41:18,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030073299] [2022-11-23 15:41:18,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:41:18,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 15:41:18,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:41:18,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 15:41:18,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:41:18,218 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:41:18,601 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-11-23 15:41:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 15:41:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-23 15:41:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:41:18,603 INFO L225 Difference]: With dead ends: 130 [2022-11-23 15:41:18,603 INFO L226 Difference]: Without dead ends: 127 [2022-11-23 15:41:18,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-23 15:41:18,604 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 143 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:41:18,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 302 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:41:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-23 15:41:18,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2022-11-23 15:41:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4) internal successors, (133), 114 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2022-11-23 15:41:18,608 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 19 [2022-11-23 15:41:18,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:41:18,609 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2022-11-23 15:41:18,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:41:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2022-11-23 15:41:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 15:41:18,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:41:18,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:18,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-23 15:41:18,611 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-23 15:41:18,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:41:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash -824217396, now seen corresponding path program 1 times [2022-11-23 15:41:18,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:41:18,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32870492] [2022-11-23 15:41:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:41:18,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:41:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:41:18,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:41:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:41:18,664 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 15:41:18,664 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:41:18,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (45 of 46 remaining) [2022-11-23 15:41:18,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 46 remaining) [2022-11-23 15:41:18,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 46 remaining) [2022-11-23 15:41:18,669 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 46 remaining) [2022-11-23 15:41:18,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 46 remaining) [2022-11-23 15:41:18,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 46 remaining) [2022-11-23 15:41:18,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 46 remaining) [2022-11-23 15:41:18,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 46 remaining) [2022-11-23 15:41:18,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 46 remaining) [2022-11-23 15:41:18,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 46 remaining) [2022-11-23 15:41:18,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 46 remaining) [2022-11-23 15:41:18,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 46 remaining) [2022-11-23 15:41:18,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 46 remaining) [2022-11-23 15:41:18,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (32 of 46 remaining) [2022-11-23 15:41:18,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 46 remaining) [2022-11-23 15:41:18,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 46 remaining) [2022-11-23 15:41:18,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 46 remaining) [2022-11-23 15:41:18,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 46 remaining) [2022-11-23 15:41:18,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (27 of 46 remaining) [2022-11-23 15:41:18,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 46 remaining) [2022-11-23 15:41:18,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 46 remaining) [2022-11-23 15:41:18,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 46 remaining) [2022-11-23 15:41:18,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 46 remaining) [2022-11-23 15:41:18,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 46 remaining) [2022-11-23 15:41:18,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 46 remaining) [2022-11-23 15:41:18,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 46 remaining) [2022-11-23 15:41:18,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 46 remaining) [2022-11-23 15:41:18,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 46 remaining) [2022-11-23 15:41:18,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 46 remaining) [2022-11-23 15:41:18,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 46 remaining) [2022-11-23 15:41:18,678 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 46 remaining) [2022-11-23 15:41:18,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 46 remaining) [2022-11-23 15:41:18,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 46 remaining) [2022-11-23 15:41:18,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 46 remaining) [2022-11-23 15:41:18,679 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 46 remaining) [2022-11-23 15:41:18,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 46 remaining) [2022-11-23 15:41:18,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 46 remaining) [2022-11-23 15:41:18,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 46 remaining) [2022-11-23 15:41:18,680 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 46 remaining) [2022-11-23 15:41:18,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (6 of 46 remaining) [2022-11-23 15:41:18,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (5 of 46 remaining) [2022-11-23 15:41:18,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (4 of 46 remaining) [2022-11-23 15:41:18,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (3 of 46 remaining) [2022-11-23 15:41:18,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (2 of 46 remaining) [2022-11-23 15:41:18,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (1 of 46 remaining) [2022-11-23 15:41:18,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (0 of 46 remaining) [2022-11-23 15:41:18,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-23 15:41:18,688 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:41:18,695 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:41:18,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:41:18 BoogieIcfgContainer [2022-11-23 15:41:18,744 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:41:18,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:41:18,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:41:18,745 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:41:18,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:40:59" (3/4) ... [2022-11-23 15:41:18,748 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 15:41:18,824 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 15:41:18,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:41:18,825 INFO L158 Benchmark]: Toolchain (without parser) took 21073.18ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 158.9MB in the beginning and 226.6MB in the end (delta: -67.7MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2022-11-23 15:41:18,825 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory was 71.9MB in the beginning and 71.8MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:41:18,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.87ms. Allocated memory is still 192.9MB. Free memory was 158.9MB in the beginning and 141.2MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 15:41:18,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.71ms. Allocated memory is still 192.9MB. Free memory was 141.2MB in the beginning and 139.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:41:18,827 INFO L158 Benchmark]: Boogie Preprocessor took 36.08ms. Allocated memory is still 192.9MB. Free memory was 139.1MB in the beginning and 137.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:41:18,828 INFO L158 Benchmark]: RCFGBuilder took 894.34ms. Allocated memory is still 192.9MB. Free memory was 137.0MB in the beginning and 114.8MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 15:41:18,828 INFO L158 Benchmark]: TraceAbstraction took 19343.39ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 113.9MB in the beginning and 228.7MB in the end (delta: -114.8MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2022-11-23 15:41:18,828 INFO L158 Benchmark]: Witness Printer took 79.90ms. Allocated memory is still 337.6MB. Free memory was 228.7MB in the beginning and 226.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:41:18,840 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory was 71.9MB in the beginning and 71.8MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.87ms. Allocated memory is still 192.9MB. Free memory was 158.9MB in the beginning and 141.2MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.71ms. Allocated memory is still 192.9MB. Free memory was 141.2MB in the beginning and 139.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.08ms. Allocated memory is still 192.9MB. Free memory was 139.1MB in the beginning and 137.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 894.34ms. Allocated memory is still 192.9MB. Free memory was 137.0MB in the beginning and 114.8MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19343.39ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 113.9MB in the beginning and 228.7MB in the end (delta: -114.8MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Witness Printer took 79.90ms. Allocated memory is still 337.6MB. Free memory was 228.7MB in the beginning and 226.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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: 1032]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = head VAL [head={-1:0}] [L998] head->data = 0 [L1000] SLL* x = head; [L1001] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1027] EXPR head->next [L1027] x = head->next [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1030] COND TRUE x->data != 0 [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1032] EXPR x->next->data [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next->data [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1032] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1032] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: 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, 90 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 19.2s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 3138 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3138 mSDsluCounter, 3538 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 134 IncrementalHoareTripleChecker+Unchecked, 2603 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3565 IncrementalHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 935 mSDtfsCounter, 3565 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=20, InterpolantAutomatonStates: 156, 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, 21 MinimizatonAttempts, 529 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 265 ConstructedInterpolants, 11 QuantifiedInterpolants, 3394 SizeOfPredicates, 5 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 1/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 15:41:18,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ac6cf-850b-4a19-845e-57c1c3de1f5f/bin/utaipan-Q6hlc19bkW/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)