./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh --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 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- 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-2329fc7 [2022-12-14 05:12:39,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 05:12:39,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 05:12:39,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 05:12:39,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 05:12:39,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 05:12:39,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 05:12:39,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 05:12:39,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 05:12:39,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 05:12:39,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 05:12:39,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 05:12:39,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 05:12:39,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 05:12:39,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 05:12:39,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 05:12:39,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 05:12:39,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 05:12:39,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 05:12:39,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 05:12:39,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 05:12:39,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 05:12:39,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 05:12:39,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 05:12:39,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 05:12:39,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 05:12:39,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 05:12:39,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 05:12:39,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 05:12:39,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 05:12:39,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 05:12:39,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 05:12:39,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 05:12:39,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 05:12:39,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 05:12:39,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 05:12:39,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 05:12:39,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 05:12:39,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 05:12:39,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 05:12:39,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 05:12:39,432 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-12-14 05:12:39,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 05:12:39,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 05:12:39,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 05:12:39,455 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 05:12:39,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 05:12:39,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 05:12:39,456 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 05:12:39,456 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 05:12:39,456 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 05:12:39,456 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 05:12:39,456 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 05:12:39,456 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 05:12:39,457 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 05:12:39,457 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 05:12:39,457 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 05:12:39,457 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 05:12:39,457 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 05:12:39,457 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 05:12:39,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 05:12:39,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 05:12:39,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 05:12:39,459 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 05:12:39,459 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 05:12:39,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 05:12:39,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 05:12:39,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 05:12:39,459 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 05:12:39,460 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 05:12:39,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 05:12:39,460 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 05:12:39,460 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 05:12:39,460 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 05:12:39,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 05:12:39,460 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 05:12:39,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:12:39,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 05:12:39,461 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 05:12:39,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 05:12:39,461 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 05:12:39,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 05:12:39,461 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 05:12:39,461 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_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/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_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh 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 -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2022-12-14 05:12:39,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 05:12:39,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 05:12:39,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 05:12:39,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 05:12:39,669 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 05:12:39,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-12-14 05:12:42,222 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 05:12:42,409 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 05:12:42,409 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2022-12-14 05:12:42,419 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/data/208e60f46/ac883e25eaa84c29bfcfb46840b8b09d/FLAGa4f5397d0 [2022-12-14 05:12:42,801 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/data/208e60f46/ac883e25eaa84c29bfcfb46840b8b09d [2022-12-14 05:12:42,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 05:12:42,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 05:12:42,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 05:12:42,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 05:12:42,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 05:12:42,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:12:42" (1/1) ... [2022-12-14 05:12:42,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b03644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:42, skipping insertion in model container [2022-12-14 05:12:42,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 05:12:42" (1/1) ... [2022-12-14 05:12:42,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 05:12:42,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 05:12:43,027 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_e7dc515b-d0af-497e-ba2b-76c64e28bee8/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-12-14 05:12:43,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:12:43,035 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 05:12:43,067 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_e7dc515b-d0af-497e-ba2b-76c64e28bee8/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2022-12-14 05:12:43,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 05:12:43,084 INFO L208 MainTranslator]: Completed translation [2022-12-14 05:12:43,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43 WrapperNode [2022-12-14 05:12:43,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 05:12:43,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 05:12:43,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 05:12:43,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 05:12:43,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,116 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2022-12-14 05:12:43,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 05:12:43,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 05:12:43,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 05:12:43,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 05:12:43,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,137 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 05:12:43,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 05:12:43,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 05:12:43,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 05:12:43,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (1/1) ... [2022-12-14 05:12:43,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 05:12:43,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:43,163 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 05:12:43,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 05:12:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-12-14 05:12:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-12-14 05:12:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 05:12:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 05:12:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 05:12:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 05:12:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2022-12-14 05:12:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2022-12-14 05:12:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 05:12:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 05:12:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 05:12:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 05:12:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 05:12:43,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 05:12:43,307 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 05:12:43,309 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 05:12:43,334 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-12-14 05:12:43,646 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 05:12:43,701 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 05:12:43,702 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 05:12:43,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:12:43 BoogieIcfgContainer [2022-12-14 05:12:43,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 05:12:43,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 05:12:43,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 05:12:43,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 05:12:43,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 05:12:42" (1/3) ... [2022-12-14 05:12:43,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbbfcf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:12:43, skipping insertion in model container [2022-12-14 05:12:43,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 05:12:43" (2/3) ... [2022-12-14 05:12:43,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbbfcf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 05:12:43, skipping insertion in model container [2022-12-14 05:12:43,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 05:12:43" (3/3) ... [2022-12-14 05:12:43,713 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2022-12-14 05:12:43,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 05:12:43,732 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-12-14 05:12:43,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 05:12:43,785 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;@5bbd3251, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 05:12:43,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-12-14 05:12:43,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 51 states have (on average 2.176470588235294) internal successors, (111), 94 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 05:12:43,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 05:12:43,796 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:43,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:43,797 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:12:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:43,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1112709035, now seen corresponding path program 1 times [2022-12-14 05:12:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:43,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008698081] [2022-12-14 05:12:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:43,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:44,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:44,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008698081] [2022-12-14 05:12:44,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008698081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:44,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:12:44,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:12:44,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52797698] [2022-12-14 05:12:44,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:44,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:12:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:44,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:12:44,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:44,076 INFO L87 Difference]: Start difference. First operand has 99 states, 51 states have (on average 2.176470588235294) internal successors, (111), 94 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:44,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:44,157 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2022-12-14 05:12:44,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:12:44,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 05:12:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:44,167 INFO L225 Difference]: With dead ends: 105 [2022-12-14 05:12:44,167 INFO L226 Difference]: Without dead ends: 100 [2022-12-14 05:12:44,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:44,172 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:44,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 169 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:44,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-14 05:12:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-12-14 05:12:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 50 states have (on average 2.08) internal successors, (104), 91 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 05:12:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-12-14 05:12:44,212 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 8 [2022-12-14 05:12:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:44,212 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-12-14 05:12:44,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-12-14 05:12:44,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 05:12:44,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:44,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:44,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 05:12:44,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:12:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:44,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1759927657, now seen corresponding path program 1 times [2022-12-14 05:12:44,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:44,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929668872] [2022-12-14 05:12:44,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:44,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:44,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:44,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929668872] [2022-12-14 05:12:44,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929668872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:44,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:12:44,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 05:12:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31222641] [2022-12-14 05:12:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:44,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 05:12:44,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:44,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 05:12:44,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:12:44,372 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:44,522 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2022-12-14 05:12:44,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:12:44,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 05:12:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:44,524 INFO L225 Difference]: With dead ends: 141 [2022-12-14 05:12:44,524 INFO L226 Difference]: Without dead ends: 141 [2022-12-14 05:12:44,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:12:44,526 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:44,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 467 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-14 05:12:44,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2022-12-14 05:12:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 112 states have internal predecessors, (147), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 05:12:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2022-12-14 05:12:44,538 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 10 [2022-12-14 05:12:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:44,538 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2022-12-14 05:12:44,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2022-12-14 05:12:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 05:12:44,539 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:44,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:44,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 05:12:44,540 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:12:44,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1276553796, now seen corresponding path program 1 times [2022-12-14 05:12:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:44,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040531376] [2022-12-14 05:12:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:44,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:44,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040531376] [2022-12-14 05:12:44,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040531376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:44,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:12:44,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:12:44,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60372470] [2022-12-14 05:12:44,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:44,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:12:44,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:44,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:12:44,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:44,638 INFO L87 Difference]: Start difference. First operand 118 states and 153 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:44,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:44,725 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2022-12-14 05:12:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:12:44,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 05:12:44,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:44,727 INFO L225 Difference]: With dead ends: 146 [2022-12-14 05:12:44,728 INFO L226 Difference]: Without dead ends: 146 [2022-12-14 05:12:44,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:44,729 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 32 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:44,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 154 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-14 05:12:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 117. [2022-12-14 05:12:44,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 2.0422535211267605) internal successors, (145), 111 states have internal predecessors, (145), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 05:12:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 151 transitions. [2022-12-14 05:12:44,739 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 151 transitions. Word has length 11 [2022-12-14 05:12:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:44,740 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 151 transitions. [2022-12-14 05:12:44,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:44,740 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2022-12-14 05:12:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 05:12:44,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:44,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:44,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 05:12:44,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:12:44,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1276553795, now seen corresponding path program 1 times [2022-12-14 05:12:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:44,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757719339] [2022-12-14 05:12:44,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:44,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:44,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:44,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757719339] [2022-12-14 05:12:44,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757719339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:44,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:12:44,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 05:12:44,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818234061] [2022-12-14 05:12:44,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:44,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 05:12:44,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:44,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 05:12:44,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:44,792 INFO L87 Difference]: Start difference. First operand 117 states and 151 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:44,870 INFO L93 Difference]: Finished difference Result 145 states and 182 transitions. [2022-12-14 05:12:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 05:12:44,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 05:12:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:44,871 INFO L225 Difference]: With dead ends: 145 [2022-12-14 05:12:44,871 INFO L226 Difference]: Without dead ends: 145 [2022-12-14 05:12:44,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 05:12:44,873 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:44,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 149 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-14 05:12:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2022-12-14 05:12:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 2.0140845070422535) internal successors, (143), 110 states have internal predecessors, (143), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 05:12:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2022-12-14 05:12:44,881 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 11 [2022-12-14 05:12:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:44,881 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2022-12-14 05:12:44,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:44,882 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2022-12-14 05:12:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 05:12:44,882 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:44,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:44,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 05:12:44,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:12:44,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1372912155, now seen corresponding path program 1 times [2022-12-14 05:12:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:44,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425792348] [2022-12-14 05:12:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:44,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:44,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:44,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425792348] [2022-12-14 05:12:44,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425792348] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:44,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993144165] [2022-12-14 05:12:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:44,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:44,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:44,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:44,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 05:12:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:45,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 05:12:45,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:45,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:45,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993144165] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:45,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224278154] [2022-12-14 05:12:45,155 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-12-14 05:12:45,155 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:12:45,159 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:12:45,165 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:12:45,165 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:12:45,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:45,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:45,245 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-12-14 05:12:45,548 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-12-14 05:12:45,571 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:12:45,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1224278154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:12:45,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:45,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 3, 3] total 17 [2022-12-14 05:12:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092829998] [2022-12-14 05:12:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:12:45,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 05:12:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 05:12:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-12-14 05:12:45,879 INFO L87 Difference]: Start difference. First operand 116 states and 149 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:46,206 INFO L93 Difference]: Finished difference Result 131 states and 167 transitions. [2022-12-14 05:12:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:12:46,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 05:12:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:46,207 INFO L225 Difference]: With dead ends: 131 [2022-12-14 05:12:46,207 INFO L226 Difference]: Without dead ends: 131 [2022-12-14 05:12:46,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-12-14 05:12:46,208 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 62 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:46,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 263 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:12:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-14 05:12:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2022-12-14 05:12:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 75 states have (on average 1.96) internal successors, (147), 113 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 05:12:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 153 transitions. [2022-12-14 05:12:46,216 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 153 transitions. Word has length 12 [2022-12-14 05:12:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:46,216 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 153 transitions. [2022-12-14 05:12:46,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 153 transitions. [2022-12-14 05:12:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 05:12:46,217 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:46,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:46,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 05:12:46,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:46,419 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:12:46,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:46,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1592209804, now seen corresponding path program 1 times [2022-12-14 05:12:46,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:46,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253670735] [2022-12-14 05:12:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:46,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:46,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:46,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253670735] [2022-12-14 05:12:46,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253670735] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:46,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340512437] [2022-12-14 05:12:46,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:46,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:46,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:46,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:46,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 05:12:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:46,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:12:46,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:46,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:46,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340512437] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:46,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1814108257] [2022-12-14 05:12:46,753 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 05:12:46,753 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:12:46,753 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:12:46,753 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:12:46,753 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:12:46,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:46,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:46,771 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-12-14 05:12:46,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:46,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:46,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-12-14 05:12:46,838 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-12-14 05:12:47,411 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-12-14 05:12:47,418 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 15 treesize of output 1 [2022-12-14 05:12:47,427 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-12-14 05:12:47,454 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:12:47,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:12:47,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 16 [2022-12-14 05:12:47,485 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 15 treesize of output 1 [2022-12-14 05:12:47,490 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-12-14 05:12:47,497 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-12-14 05:12:47,549 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:12:48,977 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1523#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (not (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1)) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (not (< 0 |sll_append_sll_create_~len#1|)) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-12-14 05:12:48,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:12:48,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:48,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-12-14 05:12:48,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107928143] [2022-12-14 05:12:48,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:48,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 05:12:48,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 05:12:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-12-14 05:12:48,979 INFO L87 Difference]: Start difference. First operand 120 states and 153 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:49,159 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2022-12-14 05:12:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 05:12:49,160 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 05:12:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:49,162 INFO L225 Difference]: With dead ends: 212 [2022-12-14 05:12:49,162 INFO L226 Difference]: Without dead ends: 212 [2022-12-14 05:12:49,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2022-12-14 05:12:49,163 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 230 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:49,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 968 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-12-14 05:12:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 119. [2022-12-14 05:12:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.9466666666666668) internal successors, (146), 114 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 05:12:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 150 transitions. [2022-12-14 05:12:49,167 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 150 transitions. Word has length 13 [2022-12-14 05:12:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:49,167 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 150 transitions. [2022-12-14 05:12:49,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 150 transitions. [2022-12-14 05:12:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 05:12:49,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:49,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:49,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 05:12:49,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 05:12:49,370 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:12:49,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:49,371 INFO L85 PathProgramCache]: Analyzing trace with hash 294387814, now seen corresponding path program 1 times [2022-12-14 05:12:49,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:49,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895993603] [2022-12-14 05:12:49,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:49,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:12:49,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:49,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895993603] [2022-12-14 05:12:49,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895993603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:49,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267262148] [2022-12-14 05:12:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:49,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:49,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:49,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:49,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 05:12:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:49,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 05:12:49,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:12:49,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 05:12:49,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267262148] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:49,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [842481368] [2022-12-14 05:12:49,516 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-12-14 05:12:49,516 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:12:49,517 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:12:49,517 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:12:49,517 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:12:49,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:49,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:49,532 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-12-14 05:12:49,674 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-12-14 05:12:49,933 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-12-14 05:12:49,939 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-12-14 05:12:49,946 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 15 treesize of output 1 [2022-12-14 05:12:49,982 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:12:49,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:12:49,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-14 05:12:50,012 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-12-14 05:12:50,019 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-12-14 05:12:50,025 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 15 treesize of output 1 [2022-12-14 05:12:50,069 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:12:50,867 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1963#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (not (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1)) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (not (< 0 |sll_append_sll_create_~len#1|)) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-12-14 05:12:50,868 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:12:50,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:50,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-14 05:12:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294214983] [2022-12-14 05:12:50,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:50,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:12:50,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:50,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:12:50,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-12-14 05:12:50,869 INFO L87 Difference]: Start difference. First operand 119 states and 150 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:50,928 INFO L93 Difference]: Finished difference Result 165 states and 201 transitions. [2022-12-14 05:12:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:12:50,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 05:12:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:50,930 INFO L225 Difference]: With dead ends: 165 [2022-12-14 05:12:50,930 INFO L226 Difference]: Without dead ends: 165 [2022-12-14 05:12:50,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-12-14 05:12:50,931 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 65 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:50,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 261 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-12-14 05:12:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2022-12-14 05:12:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.8409090909090908) internal successors, (162), 127 states have internal predecessors, (162), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 05:12:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2022-12-14 05:12:50,935 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 15 [2022-12-14 05:12:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:50,935 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2022-12-14 05:12:50,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:50,935 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-12-14 05:12:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:12:50,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:50,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:50,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 05:12:51,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 05:12:51,138 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:12:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:51,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1675736172, now seen corresponding path program 2 times [2022-12-14 05:12:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:51,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143310497] [2022-12-14 05:12:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:12:51,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:51,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143310497] [2022-12-14 05:12:51,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143310497] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:51,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83333518] [2022-12-14 05:12:51,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:12:51,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:51,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:51,296 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:51,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 05:12:51,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 05:12:51,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:12:51,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 05:12:51,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:51,378 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-12-14 05:12:51,394 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:12:51,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:12:51,411 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:12:51,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:12:51,426 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:12:51,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-12-14 05:12:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 05:12:51,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:12:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:12:51,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83333518] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:12:51,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1203756781] [2022-12-14 05:12:51,517 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 05:12:51,518 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:12:51,518 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:12:51,518 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:12:51,518 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:12:51,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:51,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:51,531 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-12-14 05:12:51,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:51,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:51,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-12-14 05:12:51,590 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-12-14 05:12:52,030 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-12-14 05:12:52,037 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-12-14 05:12:52,045 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 15 treesize of output 1 [2022-12-14 05:12:52,068 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:12:52,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 05:12:52,090 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:12:52,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:12:52,108 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-12-14 05:12:52,115 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-12-14 05:12:52,124 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 15 treesize of output 1 [2022-12-14 05:12:52,173 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:12:53,281 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2388#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (not (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1)) (<= |sll_append_#in~sublist_length#1| 3) (<= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= |sll_append_#in~head#1.offset| 0) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (<= 0 |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (not (< 0 |sll_append_sll_create_~len#1|)) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (<= 3 |sll_append_#in~sublist_length#1|) (<= 0 |sll_append_#in~head#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (<= 0 |#StackHeapBarrier|) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-12-14 05:12:53,281 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:12:53,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:12:53,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-12-14 05:12:53,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105817686] [2022-12-14 05:12:53,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:12:53,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 05:12:53,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:12:53,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 05:12:53,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-12-14 05:12:53,283 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:12:53,346 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2022-12-14 05:12:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:12:53,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 05:12:53,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:12:53,347 INFO L225 Difference]: With dead ends: 132 [2022-12-14 05:12:53,347 INFO L226 Difference]: Without dead ends: 132 [2022-12-14 05:12:53,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-12-14 05:12:53,348 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 83 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:12:53,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 180 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:12:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-12-14 05:12:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-12-14 05:12:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.7954545454545454) internal successors, (158), 125 states have internal predecessors, (158), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 05:12:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2022-12-14 05:12:53,353 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 19 [2022-12-14 05:12:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:12:53,354 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2022-12-14 05:12:53,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:12:53,354 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2022-12-14 05:12:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 05:12:53,354 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:12:53,355 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:12:53,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 05:12:53,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 05:12:53,555 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting sll_appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:12:53,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:12:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1675736171, now seen corresponding path program 1 times [2022-12-14 05:12:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:12:53,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290586433] [2022-12-14 05:12:53,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:53,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:12:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 05:12:53,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:12:53,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290586433] [2022-12-14 05:12:53,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290586433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:12:53,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508866417] [2022-12-14 05:12:53,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:12:53,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:12:53,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:12:53,719 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:12:53,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 05:12:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:12:53,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 05:12:53,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:12:53,799 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-12-14 05:12:53,802 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-12-14 05:12:53,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:53,826 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 05:12:53,838 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:12:53,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-14 05:12:53,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:53,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-14 05:12:53,905 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 05:12:53,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-14 05:12:53,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:12:53,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-14 05:12:53,995 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 05:12:53,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-12-14 05:12:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:12:54,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:02,473 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:13:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:02,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508866417] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:02,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108281716] [2022-12-14 05:13:02,552 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 05:13:02,552 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:13:02,552 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:13:02,552 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:13:02,553 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:13:02,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:02,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:02,564 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-12-14 05:13:02,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:02,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:02,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-12-14 05:13:02,614 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-12-14 05:13:03,012 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 15 treesize of output 1 [2022-12-14 05:13:03,018 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-12-14 05:13:03,024 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-12-14 05:13:03,048 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:13:03,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-14 05:13:03,067 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:13:03,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:13:03,087 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-12-14 05:13:03,093 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 15 treesize of output 1 [2022-12-14 05:13:03,099 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-12-14 05:13:03,151 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:13:04,790 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2783#(and (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (< (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8)) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (not (< 0 |sll_append_sll_create_~len#1|)) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_#res#1.offset| |sll_append_node_create_with_sublist_#t~ret6#1.offset|) (= |sll_append_sll_create_#res#1.base| |sll_append_node_create_with_sublist_#t~ret6#1.base|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (<= |sll_append_~head#1.offset| 0) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-12-14 05:13:04,790 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:13:04,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:04,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-12-14 05:13:04,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760197284] [2022-12-14 05:13:04,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:04,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 05:13:04,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 05:13:04,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2022-12-14 05:13:04,792 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:05,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:05,124 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2022-12-14 05:13:05,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:13:05,125 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 05:13:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:05,126 INFO L225 Difference]: With dead ends: 157 [2022-12-14 05:13:05,126 INFO L226 Difference]: Without dead ends: 157 [2022-12-14 05:13:05,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2022-12-14 05:13:05,127 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 235 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:05,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 170 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:13:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-14 05:13:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 130. [2022-12-14 05:13:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 88 states have (on average 1.75) internal successors, (154), 123 states have internal predecessors, (154), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 05:13:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2022-12-14 05:13:05,130 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 19 [2022-12-14 05:13:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:05,130 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2022-12-14 05:13:05,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2022-12-14 05:13:05,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:13:05,131 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:05,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:05,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 05:13:05,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:05,332 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting sll_appendErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:13:05,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:05,333 INFO L85 PathProgramCache]: Analyzing trace with hash 230518915, now seen corresponding path program 1 times [2022-12-14 05:13:05,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:05,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493505079] [2022-12-14 05:13:05,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:05,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 05:13:05,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:05,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493505079] [2022-12-14 05:13:05,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493505079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:13:05,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:13:05,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 05:13:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754442106] [2022-12-14 05:13:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:13:05,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 05:13:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:05,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 05:13:05,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 05:13:05,393 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:05,463 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2022-12-14 05:13:05,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:13:05,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 05:13:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:05,464 INFO L225 Difference]: With dead ends: 129 [2022-12-14 05:13:05,464 INFO L226 Difference]: Without dead ends: 129 [2022-12-14 05:13:05,465 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-12-14 05:13:05,465 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:05,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 144 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:13:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-14 05:13:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-12-14 05:13:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.7272727272727273) internal successors, (152), 122 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 05:13:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2022-12-14 05:13:05,468 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 21 [2022-12-14 05:13:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:05,468 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2022-12-14 05:13:05,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2022-12-14 05:13:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 05:13:05,469 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:05,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:05,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 05:13:05,470 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting sll_appendErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:13:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash 230518916, now seen corresponding path program 1 times [2022-12-14 05:13:05,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:05,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192646057] [2022-12-14 05:13:05,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:05,545 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 05:13:05,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:05,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192646057] [2022-12-14 05:13:05,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192646057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:13:05,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:13:05,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 05:13:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775131890] [2022-12-14 05:13:05,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:13:05,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 05:13:05,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:05,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 05:13:05,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 05:13:05,547 INFO L87 Difference]: Start difference. First operand 129 states and 160 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:05,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:05,615 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2022-12-14 05:13:05,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 05:13:05,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 05:13:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:05,616 INFO L225 Difference]: With dead ends: 128 [2022-12-14 05:13:05,616 INFO L226 Difference]: Without dead ends: 128 [2022-12-14 05:13:05,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 05:13:05,617 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 70 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:05,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 164 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:13:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-12-14 05:13:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-12-14 05:13:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.7045454545454546) internal successors, (150), 121 states have internal predecessors, (150), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 05:13:05,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2022-12-14 05:13:05,621 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 21 [2022-12-14 05:13:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:05,621 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2022-12-14 05:13:05,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2022-12-14 05:13:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 05:13:05,622 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:05,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:05,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 05:13:05,622 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting sll_appendErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:13:05,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1443848204, now seen corresponding path program 1 times [2022-12-14 05:13:05,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:05,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133811508] [2022-12-14 05:13:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:05,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:05,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 05:13:05,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:05,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133811508] [2022-12-14 05:13:05,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133811508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:05,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936738530] [2022-12-14 05:13:05,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:05,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:05,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:05,835 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:05,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 05:13:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:05,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 05:13:05,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:05,921 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-12-14 05:13:05,945 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:13:05,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-12-14 05:13:05,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:05,971 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 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 05:13:05,987 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:13:05,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 22 [2022-12-14 05:13:06,035 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-12-14 05:13:06,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 38 [2022-12-14 05:13:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:13:06,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 05:13:06,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936738530] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:06,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1700990612] [2022-12-14 05:13:06,308 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 05:13:06,309 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:13:06,309 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:13:06,309 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:13:06,309 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:13:06,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:06,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:06,320 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-12-14 05:13:06,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:06,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:06,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-12-14 05:13:06,365 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-12-14 05:13:06,799 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-12-14 05:13:06,804 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 15 treesize of output 1 [2022-12-14 05:13:06,810 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-12-14 05:13:06,828 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:13:06,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-14 05:13:06,847 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:13:06,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:13:06,863 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 15 treesize of output 1 [2022-12-14 05:13:06,869 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-12-14 05:13:06,875 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-12-14 05:13:06,952 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-12-14 05:13:06,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:06,997 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 21 treesize of output 20 [2022-12-14 05:13:07,031 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-12-14 05:13:07,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:07,103 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 21 treesize of output 20 [2022-12-14 05:13:07,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:07,174 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:13:07,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 05:13:07,201 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-12-14 05:13:07,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:07,269 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 05:13:07,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:07,303 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 05:13:07,303 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 35 treesize of output 33 [2022-12-14 05:13:07,318 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-12-14 05:13:07,385 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:13:09,573 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3751#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (not (= (select |#valid| |sll_append_~head#1.base|) 1)) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (= |sll_append_sll_create_~new_head~0#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |#NULL.offset| 0) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 3 |sll_append_sll_create_#in~len#1|) (= |sll_append_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-12-14 05:13:09,574 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:13:09,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:09,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-12-14 05:13:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822402514] [2022-12-14 05:13:09,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:09,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 05:13:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:09,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 05:13:09,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2022-12-14 05:13:09,575 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:09,722 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2022-12-14 05:13:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 05:13:09,723 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 05:13:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:09,723 INFO L225 Difference]: With dead ends: 147 [2022-12-14 05:13:09,723 INFO L226 Difference]: Without dead ends: 147 [2022-12-14 05:13:09,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2022-12-14 05:13:09,724 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 192 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:09,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 204 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 05:13:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-14 05:13:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2022-12-14 05:13:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.6363636363636365) internal successors, (144), 117 states have internal predecessors, (144), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 05:13:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2022-12-14 05:13:09,726 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 22 [2022-12-14 05:13:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:09,727 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2022-12-14 05:13:09,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2022-12-14 05:13:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 05:13:09,727 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:09,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:09,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 05:13:09,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 05:13:09,929 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting sll_appendErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:13:09,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1443848203, now seen corresponding path program 1 times [2022-12-14 05:13:09,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:09,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772951564] [2022-12-14 05:13:09,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:09,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 05:13:10,214 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772951564] [2022-12-14 05:13:10,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772951564] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:10,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519322074] [2022-12-14 05:13:10,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:10,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:10,216 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:10,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 05:13:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:10,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-14 05:13:10,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:10,314 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-12-14 05:13:10,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:10,351 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 05:13:10,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:10,373 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 05:13:10,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:10,388 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 05:13:10,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:10,405 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 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 05:13:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 05:13:10,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:12,539 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_472 Int) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_473 Int)) (<= (+ |c_sll_append_~head#1.offset| 4) (select (store (store |c_#length| |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_sll_append_~head#1.base|))))))) (<= 0 |c_sll_append_~head#1.offset|)) is different from false [2022-12-14 05:13:14,577 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_471 Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_472 Int) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (forall ((v_ArrVal_473 Int)) (<= (+ |c_sll_append_~head#1.offset| 4) (select (store (store (store |c_#length| |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_471) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_sll_append_~head#1.base|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))))) (<= 0 |c_sll_append_~head#1.offset|)) is different from false [2022-12-14 05:13:16,649 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_sll_append_#in~head#1.offset|) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (forall ((v_ArrVal_470 Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (forall ((v_ArrVal_471 Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_472 Int) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_473 Int)) (<= (+ |c_sll_append_#in~head#1.offset| 4) (select (store (store (store (store |c_#length| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_470) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_471) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_sll_append_#in~head#1.base|))))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| |c_#StackHeapBarrier|))))) is different from false [2022-12-14 05:13:18,689 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| Int)) (or (forall ((v_ArrVal_470 Int) (|v_sll_append_sll_create_~new_head~0#1.base_48| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_48| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_471 Int) (|v_sll_append_sll_create_~new_head~0#1.base_47| Int)) (or (forall ((v_ArrVal_472 Int) (|v_sll_append_sll_create_~new_head~0#1.base_46| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_473 Int)) (<= (+ 4 |c_ULTIMATE.start_main_~#head~1#1.offset|) (select (store (store (store (store |c_#length| |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| v_ArrVal_470) |v_sll_append_sll_create_~new_head~0#1.base_48| v_ArrVal_471) |v_sll_append_sll_create_~new_head~0#1.base_47| v_ArrVal_472) |v_sll_append_sll_create_~new_head~0#1.base_46| v_ArrVal_473) |c_ULTIMATE.start_main_~#head~1#1.base|))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_47| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_24| |c_#StackHeapBarrier|)))) (<= 0 |c_ULTIMATE.start_main_~#head~1#1.offset|)) is different from false [2022-12-14 05:13:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-14 05:13:18,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519322074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:13:18,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1769576502] [2022-12-14 05:13:18,764 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-12-14 05:13:18,764 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:13:18,765 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:13:18,765 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:13:18,765 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:13:18,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:18,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:18,776 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-12-14 05:13:18,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:18,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:18,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-12-14 05:13:18,821 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-12-14 05:13:19,255 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-12-14 05:13:19,261 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-12-14 05:13:19,267 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 15 treesize of output 1 [2022-12-14 05:13:19,291 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:13:19,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 05:13:19,310 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:13:19,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:13:19,333 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-12-14 05:13:19,338 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-12-14 05:13:19,343 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 15 treesize of output 1 [2022-12-14 05:13:19,422 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-12-14 05:13:19,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:19,448 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 21 treesize of output 20 [2022-12-14 05:13:19,467 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-12-14 05:13:19,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:19,561 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:13:19,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 05:13:19,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:19,577 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 21 treesize of output 20 [2022-12-14 05:13:19,606 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-12-14 05:13:19,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:19,678 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 05:13:19,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:19,723 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 05:13:19,723 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 35 treesize of output 33 [2022-12-14 05:13:19,755 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-12-14 05:13:19,814 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:13:21,683 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4176#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= 3 |sll_append_#in~sublist_length#1|) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (= |sll_append_#in~head#1.offset| 0) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (< (select |#length| |sll_append_~head#1.base|) (+ |sll_append_~head#1.offset| 4)) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-12-14 05:13:21,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:13:21,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:13:21,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 12 [2022-12-14 05:13:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089221693] [2022-12-14 05:13:21,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:13:21,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 05:13:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:13:21,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 05:13:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=385, Unknown=4, NotChecked=172, Total=650 [2022-12-14 05:13:21,685 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:13:21,883 INFO L93 Difference]: Finished difference Result 143 states and 171 transitions. [2022-12-14 05:13:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 05:13:21,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 05:13:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:13:21,884 INFO L225 Difference]: With dead ends: 143 [2022-12-14 05:13:21,884 INFO L226 Difference]: Without dead ends: 143 [2022-12-14 05:13:21,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=98, Invalid=420, Unknown=4, NotChecked=180, Total=702 [2022-12-14 05:13:21,885 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 200 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 349 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:13:21,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 129 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 213 Invalid, 0 Unknown, 349 Unchecked, 0.1s Time] [2022-12-14 05:13:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-12-14 05:13:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 120. [2022-12-14 05:13:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 113 states have internal predecessors, (138), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 05:13:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-12-14 05:13:21,889 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 22 [2022-12-14 05:13:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:13:21,889 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-12-14 05:13:21,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:13:21,890 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-12-14 05:13:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 05:13:21,890 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:13:21,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:13:21,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 05:13:22,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:22,092 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting sll_appendErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:13:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:13:22,093 INFO L85 PathProgramCache]: Analyzing trace with hash -263477966, now seen corresponding path program 1 times [2022-12-14 05:13:22,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:13:22,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624281212] [2022-12-14 05:13:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:22,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:13:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 05:13:22,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:13:22,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624281212] [2022-12-14 05:13:22,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624281212] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:13:22,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083655954] [2022-12-14 05:13:22,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:13:22,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:13:22,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:13:22,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:13:22,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 05:13:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:13:22,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 05:13:22,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:13:22,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:22,767 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 14 treesize of output 16 [2022-12-14 05:13:22,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:22,771 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 14 treesize of output 16 [2022-12-14 05:13:22,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:22,831 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 14 treesize of output 16 [2022-12-14 05:13:22,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:22,836 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 18 [2022-12-14 05:13:22,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:22,922 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 14 treesize of output 16 [2022-12-14 05:13:22,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:22,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:22,932 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:13:22,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2022-12-14 05:13:22,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:22,982 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 14 treesize of output 16 [2022-12-14 05:13:22,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:22,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:22,994 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:13:22,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-12-14 05:13:23,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:23,029 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 14 treesize of output 16 [2022-12-14 05:13:23,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:23,036 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 14 treesize of output 16 [2022-12-14 05:13:23,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:23,061 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 14 treesize of output 16 [2022-12-14 05:13:23,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:13:23,065 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 14 treesize of output 16 [2022-12-14 05:13:23,087 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 15 treesize of output 7 [2022-12-14 05:13:23,089 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 15 treesize of output 7 [2022-12-14 05:13:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 05:13:23,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:13:23,101 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_sll_append_~new_last~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_sll_append_~new_last~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-12-14 05:13:23,165 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_sll_append_sll_create_~new_head~0#1.base|) |c_sll_append_sll_create_~new_head~0#1.offset| |c_sll_append_sll_create_~head~0#1.offset|)) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_sll_append_sll_create_~new_head~0#1.base| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))) is different from false [2022-12-14 05:13:32,585 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 |c_sll_append_sll_create_~head~0#1.offset|)))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0))))))) is different from false [2022-12-14 05:14:01,664 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:14:03,755 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_578) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)))) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |c_sll_append_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_579) |c_sll_append_~head#1.base|) |c_sll_append_~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|))))) is different from false [2022-12-14 05:14:05,901 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (forall ((v_ArrVal_579 (Array Int Int))) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_579) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)) (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)))))))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_578) |c_sll_append_#in~head#1.base|) |c_sll_append_#in~head#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|))))))) is different from false [2022-12-14 05:14:07,972 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((|v_sll_append_sll_create_~new_head~0#1.base_55| Int) (v_ArrVal_566 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int)) (or (forall ((v_ArrVal_579 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_566))) (store .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55| (store (select .cse1 |v_sll_append_sll_create_~new_head~0#1.base_55|) 0 0))))) (store .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54| (store (select .cse0 |v_sll_append_sll_create_~new_head~0#1.base_54|) 0 0))) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_579) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|)))))) (forall ((|v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| Int)) (or (not (< |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_56| Int)) (or (forall ((v_ArrVal_567 (Array Int Int)) (|v_sll_append_sll_create_~new_head~0#1.base_55| Int)) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_55| |c_#StackHeapBarrier|)) (forall ((|v_sll_append_sll_create_~new_head~0#1.base_54| Int) (v_ArrVal_569 (Array Int Int))) (or (not (< |v_sll_append_sll_create_~new_head~0#1.base_54| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_571 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |v_sll_append_sll_create_~new_head~0#1.base_56| v_ArrVal_567) |v_sll_append_sll_create_~new_head~0#1.base_55| v_ArrVal_569) |v_sll_append_sll_create_~new_head~0#1.base_54| v_ArrVal_571) |v_sll_append_node_create_with_sublist_~new_node~0#1.base_25| v_ArrVal_578) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0)))))) (not (< |v_sll_append_sll_create_~new_head~0#1.base_56| |c_#StackHeapBarrier|))))))) is different from false [2022-12-14 05:14:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-14 05:14:08,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083655954] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:14:08,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [863404621] [2022-12-14 05:14:08,154 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-12-14 05:14:08,154 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:14:08,154 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:14:08,154 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:14:08,154 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:14:08,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:08,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:08,173 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-12-14 05:14:08,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:08,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:08,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2022-12-14 05:14:08,234 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 62 for LOIs [2022-12-14 05:14:08,663 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-12-14 05:14:08,671 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 15 treesize of output 1 [2022-12-14 05:14:08,677 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-12-14 05:14:08,720 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:14:08,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:14:08,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 16 [2022-12-14 05:14:08,750 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-12-14 05:14:08,758 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-12-14 05:14:08,766 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 15 treesize of output 1 [2022-12-14 05:14:08,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:08,864 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 21 treesize of output 20 [2022-12-14 05:14:08,882 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-12-14 05:14:08,905 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-12-14 05:14:08,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:08,970 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 21 treesize of output 20 [2022-12-14 05:14:09,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:09,052 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:14:09,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 05:14:09,070 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-12-14 05:14:09,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:09,165 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 05:14:09,165 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 35 treesize of output 33 [2022-12-14 05:14:09,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:09,205 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 05:14:09,222 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-12-14 05:14:09,405 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:14:15,795 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4628#(and (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (= |sll_append_node_create_with_sublist_#res#1.base| |sll_append_~new_last~0#1.base|) (<= 0 |sll_append_~head#1.offset|) (not (= 0 |sll_append_sll_create_~new_head~0#1.base|)) (<= |sll_append_~sublist_length#1| 3) (<= 0 |sll_append_#in~head#1.base|) (= (select |#valid| |sll_append_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.offset|) (<= |sll_append_#in~sublist_length#1| 3) (<= |sll_append_node_create_with_sublist_~new_node~0#1.offset| 0) (<= |sll_append_#in~head#1.offset| 0) (<= |sll_append_node_create_with_sublist_~sublist_length#1| 3) (<= (+ |sll_append_sll_create_~new_head~0#1.offset| 4) (select |#length| |sll_append_sll_create_~new_head~0#1.base|)) (<= 0 |sll_append_~head#1.base|) (= |sll_append_sll_create_#res#1.offset| (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |sll_append_sll_create_~new_head~0#1.offset|) (<= |sll_append_sll_create_~len#1| 0) (= |sll_append_sll_create_#res#1.offset| |sll_append_sll_create_~head~0#1.offset|) (<= (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 8) (select |#length| |sll_append_node_create_with_sublist_~new_node~0#1.base|)) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_~new_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |sll_append_sll_create_~new_head~0#1.base|) |sll_append_sll_create_~new_head~0#1.offset|) 0) (= (select |#valid| |sll_append_sll_create_~new_head~0#1.base|) 1) (<= (+ |sll_append_~head#1.offset| 4) (select |#length| |sll_append_~head#1.base|)) (<= |#NULL.offset| 0) (= |sll_append_sll_create_#res#1.base| |sll_append_sll_create_~head~0#1.base|) (or (not (= |sll_append_~temp~0#1.base| 0)) (not (= |sll_append_~temp~0#1.offset| 0))) (<= 3 |sll_append_node_create_with_sublist_~sublist_length#1|) (<= 0 |sll_append_~new_last~0#1.offset|) (<= 0 |sll_append_sll_create_~head~0#1.offset|) (<= |sll_append_sll_create_~head~0#1.offset| 0) (<= 3 |sll_append_~sublist_length#1|) (= (select (select |#memory_$Pointer$.base| |sll_append_~head#1.base|) |sll_append_~head#1.offset|) |sll_append_~temp~0#1.base|) (<= |sll_append_node_create_with_sublist_#in~sublist_length#1| 3) (<= |sll_append_sll_create_#in~len#1| 3) (<= |sll_append_sll_create_~new_head~0#1.offset| 0) (<= 3 |sll_append_#in~sublist_length#1|) (<= 0 |sll_append_#in~head#1.offset|) (= |sll_append_node_create_with_sublist_#res#1.offset| |sll_append_node_create_with_sublist_~new_node~0#1.offset|) (= |sll_append_sll_create_~head~0#1.base| |sll_append_sll_create_~new_head~0#1.base|) (= (select |#valid| |sll_append_node_create_with_sublist_~new_node~0#1.base|) 1) (<= |sll_append_~head#1.offset| 0) (= |sll_append_sll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) (+ |sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (<= 0 |#NULL.offset|) (<= 3 |sll_append_sll_create_#in~len#1|) (not (= (select |#valid| |sll_append_~temp~0#1.base|) 1)) (= (select (select |#memory_$Pointer$.offset| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |sll_append_node_create_with_sublist_~new_node~0#1.base|) |sll_append_node_create_with_sublist_~new_node~0#1.offset|) 0) (<= 0 |#StackHeapBarrier|) (<= 3 |sll_append_node_create_with_sublist_#in~sublist_length#1|) (= |#NULL.base| 0))' at error location [2022-12-14 05:14:15,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:14:15,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:14:15,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 13] total 32 [2022-12-14 05:14:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377253173] [2022-12-14 05:14:15,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:14:15,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 05:14:15,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:14:15,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 05:14:15,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1370, Unknown=62, NotChecked=498, Total=2162 [2022-12-14 05:14:15,796 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 29 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:14:30,311 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 93 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 05:14:32,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 05:14:34,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 05:14:36,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 05:14:38,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 05:14:44,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 05:14:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:14:52,537 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2022-12-14 05:14:52,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 05:14:52,538 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 29 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 05:14:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:14:52,539 INFO L225 Difference]: With dead ends: 174 [2022-12-14 05:14:52,539 INFO L226 Difference]: Without dead ends: 174 [2022-12-14 05:14:52,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 76.8s TimeCoverageRelationStatistics Valid=436, Invalid=1968, Unknown=70, NotChecked=606, Total=3080 [2022-12-14 05:14:52,540 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 33 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 24 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-12-14 05:14:52,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1059 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 477 Invalid, 5 Unknown, 321 Unchecked, 11.1s Time] [2022-12-14 05:14:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-12-14 05:14:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2022-12-14 05:14:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 132 states have (on average 1.4242424242424243) internal successors, (188), 161 states have internal predecessors, (188), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 05:14:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 208 transitions. [2022-12-14 05:14:52,544 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 208 transitions. Word has length 24 [2022-12-14 05:14:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:14:52,544 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 208 transitions. [2022-12-14 05:14:52,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 29 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 05:14:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions. [2022-12-14 05:14:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 05:14:52,545 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:14:52,545 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:14:52,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 05:14:52,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 05:14:52,747 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:14:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:14:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash 637236949, now seen corresponding path program 1 times [2022-12-14 05:14:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:14:52,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165014963] [2022-12-14 05:14:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:14:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:14:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 05:14:52,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:14:52,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165014963] [2022-12-14 05:14:52,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165014963] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:14:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905482167] [2022-12-14 05:14:52,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:14:52,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:14:52,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:14:52,869 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:14:52,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 05:14:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:14:52,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 05:14:52,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:14:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:14:53,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:14:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:14:53,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905482167] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:14:53,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1244064215] [2022-12-14 05:14:53,489 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2022-12-14 05:14:53,489 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:14:53,489 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:14:53,490 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:14:53,490 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:14:53,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:53,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:53,508 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-12-14 05:14:53,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 05:14:53,637 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 05:14:53,694 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:14:53,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:14:53,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-14 05:14:53,715 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-12-14 05:14:53,723 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 15 treesize of output 1 [2022-12-14 05:14:53,730 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-12-14 05:14:53,783 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-12-14 05:14:53,784 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 2 case distinctions, treesize of input 17 treesize of output 22 [2022-12-14 05:14:53,853 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 05:14:53,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-14 05:14:53,893 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-12-14 05:14:53,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:14:53,926 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:14:53,926 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 197 treesize of output 196 [2022-12-14 05:14:53,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:14:53,954 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:14:53,954 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 205 treesize of output 204 [2022-12-14 05:14:54,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:54,052 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-12-14 05:14:54,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 233 treesize of output 235 [2022-12-14 05:14:54,173 INFO L321 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2022-12-14 05:14:54,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 236 treesize of output 256 [2022-12-14 05:14:54,224 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-12-14 05:14:54,230 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 15 treesize of output 1 [2022-12-14 05:14:54,236 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-12-14 05:14:54,271 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:14:54,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-14 05:14:54,310 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:14:54,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:14:54,330 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-12-14 05:14:54,337 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-12-14 05:14:54,344 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 15 treesize of output 1 [2022-12-14 05:14:54,375 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-12-14 05:14:54,435 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 05:14:54,436 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 114 treesize of output 123 [2022-12-14 05:14:54,460 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-12-14 05:14:54,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:54,536 INFO L321 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-12-14 05:14:54,537 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 141 [2022-12-14 05:14:54,568 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-12-14 05:14:54,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:54,583 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 21 treesize of output 20 [2022-12-14 05:14:54,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:54,608 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 05:14:54,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:54,653 INFO L321 Elim1Store]: treesize reduction 51, result has 12.1 percent of original size [2022-12-14 05:14:54,654 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 143 [2022-12-14 05:14:54,681 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-12-14 05:14:54,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:54,848 INFO L321 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-12-14 05:14:54,848 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 65 [2022-12-14 05:14:54,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:54,971 INFO L321 Elim1Store]: treesize reduction 142, result has 14.5 percent of original size [2022-12-14 05:14:54,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 152 treesize of output 153 [2022-12-14 05:14:54,997 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-12-14 05:14:55,196 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-12-14 05:14:55,476 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-12-14 05:14:55,483 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 15 treesize of output 1 [2022-12-14 05:14:55,491 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-12-14 05:14:55,525 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:14:55,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 05:14:55,562 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:14:55,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:14:55,590 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-12-14 05:14:55,597 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 15 treesize of output 1 [2022-12-14 05:14:55,604 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-12-14 05:14:55,707 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-12-14 05:14:55,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:55,725 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 21 treesize of output 20 [2022-12-14 05:14:55,745 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-12-14 05:14:55,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:55,814 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 21 treesize of output 20 [2022-12-14 05:14:55,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:55,884 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:14:55,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 05:14:55,903 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-12-14 05:14:55,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:55,998 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 05:14:55,998 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 35 treesize of output 33 [2022-12-14 05:14:56,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:56,018 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 05:14:56,053 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-12-14 05:14:56,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:56,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:14:56,229 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 05:14:56,230 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2022-12-14 05:14:56,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:14:56,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:14:56,321 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-12-14 05:14:56,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 43 [2022-12-14 05:14:56,352 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-12-14 05:14:56,436 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:15:01,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1244064215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:15:01,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:15:01,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [5, 7, 7] total 31 [2022-12-14 05:15:01,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540920678] [2022-12-14 05:15:01,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:15:01,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 05:15:01,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:01,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 05:15:01,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2022-12-14 05:15:01,926 INFO L87 Difference]: Start difference. First operand 170 states and 208 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:15:05,295 INFO L93 Difference]: Finished difference Result 242 states and 286 transitions. [2022-12-14 05:15:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 05:15:05,296 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-12-14 05:15:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:15:05,298 INFO L225 Difference]: With dead ends: 242 [2022-12-14 05:15:05,298 INFO L226 Difference]: Without dead ends: 242 [2022-12-14 05:15:05,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 05:15:05,299 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 151 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-14 05:15:05,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 282 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-12-14 05:15:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-12-14 05:15:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 173. [2022-12-14 05:15:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 135 states have (on average 1.4222222222222223) internal successors, (192), 164 states have internal predecessors, (192), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 05:15:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 212 transitions. [2022-12-14 05:15:05,308 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 212 transitions. Word has length 34 [2022-12-14 05:15:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:15:05,308 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 212 transitions. [2022-12-14 05:15:05,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 17 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 212 transitions. [2022-12-14 05:15:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 05:15:05,309 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:15:05,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:15:05,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 05:15:05,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 05:15:05,511 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:15:05,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:15:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1715829828, now seen corresponding path program 1 times [2022-12-14 05:15:05,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:15:05,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108670635] [2022-12-14 05:15:05,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:15:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:15:05,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:05,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108670635] [2022-12-14 05:15:05,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108670635] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:15:05,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335452499] [2022-12-14 05:15:05,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:05,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:15:05,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:15:05,753 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:15:05,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 05:15:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:05,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 05:15:05,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:15:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:15:06,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:15:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:15:06,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335452499] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:15:06,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1720341036] [2022-12-14 05:15:06,350 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 05:15:06,350 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:15:06,350 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:15:06,350 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:15:06,350 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:15:06,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:06,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:06,368 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-12-14 05:15:06,663 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-12-14 05:15:06,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-12-14 05:15:06,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:06,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-12-14 05:15:06,751 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 05:15:06,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 05:15:06,795 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 05:15:06,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-14 05:15:06,839 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:15:06,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:15:06,857 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 15 treesize of output 1 [2022-12-14 05:15:06,865 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-12-14 05:15:06,875 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-12-14 05:15:06,949 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 05:15:06,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-14 05:15:06,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-12-14 05:15:07,000 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-12-14 05:15:07,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:15:07,034 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:15:07,034 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 204 treesize of output 203 [2022-12-14 05:15:07,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:15:07,063 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 05:15:07,063 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 244 treesize of output 243 [2022-12-14 05:15:07,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:07,147 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-12-14 05:15:07,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 256 treesize of output 252 [2022-12-14 05:15:07,275 INFO L321 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2022-12-14 05:15:07,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 259 treesize of output 279 [2022-12-14 05:15:07,312 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-12-14 05:15:07,318 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-12-14 05:15:07,324 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 15 treesize of output 1 [2022-12-14 05:15:07,365 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:15:07,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:15:07,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-14 05:15:07,384 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-12-14 05:15:07,392 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-12-14 05:15:07,399 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 15 treesize of output 1 [2022-12-14 05:15:07,471 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 05:15:07,471 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 114 treesize of output 123 [2022-12-14 05:15:07,490 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-12-14 05:15:07,504 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-12-14 05:15:07,523 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-12-14 05:15:07,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:07,589 INFO L321 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-12-14 05:15:07,589 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 141 [2022-12-14 05:15:07,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:07,635 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 21 treesize of output 20 [2022-12-14 05:15:07,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:07,707 INFO L321 Elim1Store]: treesize reduction 51, result has 12.1 percent of original size [2022-12-14 05:15:07,707 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 143 [2022-12-14 05:15:07,729 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-12-14 05:15:07,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:07,744 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 05:15:07,798 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-12-14 05:15:07,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:07,907 INFO L321 Elim1Store]: treesize reduction 142, result has 14.5 percent of original size [2022-12-14 05:15:07,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 152 treesize of output 153 [2022-12-14 05:15:07,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:08,072 INFO L321 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-12-14 05:15:08,073 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 65 [2022-12-14 05:15:08,212 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:15:08,213 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:15:08,214 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:15:08,377 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-12-14 05:15:08,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-12-14 05:15:08,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:08,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-12-14 05:15:08,514 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:15:08,516 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:15:08,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 05:15:08,716 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-12-14 05:15:08,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-12-14 05:15:08,781 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:08,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-12-14 05:15:08,792 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-12-14 05:15:09,066 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 15 treesize of output 1 [2022-12-14 05:15:09,073 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-12-14 05:15:09,082 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-12-14 05:15:09,125 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:15:09,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:15:09,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-14 05:15:09,156 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-12-14 05:15:09,165 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-12-14 05:15:09,180 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 15 treesize of output 1 [2022-12-14 05:15:09,235 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-12-14 05:15:09,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:09,260 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 21 treesize of output 20 [2022-12-14 05:15:09,278 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-12-14 05:15:09,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:09,373 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:15:09,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 05:15:09,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:09,392 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 21 treesize of output 20 [2022-12-14 05:15:09,412 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-12-14 05:15:09,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:09,494 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 05:15:09,494 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 35 treesize of output 33 [2022-12-14 05:15:09,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:09,521 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 05:15:09,551 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-12-14 05:15:09,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:09,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:15:09,730 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 05:15:09,730 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2022-12-14 05:15:09,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:09,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:15:09,817 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-12-14 05:15:09,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 43 [2022-12-14 05:15:09,855 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-12-14 05:15:09,910 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:15:16,145 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5873#(and (exists ((|v_ULTIMATE.start_main_~#head~1#1.base_27| Int)) (and (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#head~1#1.base_27|) 0)) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#head~1#1.base_27|) 0)) (= (select |#valid| |v_ULTIMATE.start_main_~#head~1#1.base_27|) 0) (<= 0 |v_ULTIMATE.start_main_~#head~1#1.base_27|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#head~1#1.base_27|) 0) |ULTIMATE.start_sll_hierarchical_destroy_#in~head#1.base|) (= |ULTIMATE.start_sll_hierarchical_destroy_#in~head#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#head~1#1.base_27|) 0)) (<= 4 (select |#length| |v_ULTIMATE.start_main_~#head~1#1.base_27|)))) (= |ULTIMATE.start_sll_hierarchical_destroy_~head#1.offset| 0) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~min~0#1| |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~min~0#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_hierarchical_destroy_#in~head#1.base| |ULTIMATE.start_sll_hierarchical_destroy_~head#1.base|) (= |ULTIMATE.start_main_~j~0#1| 0) (= 0 |ULTIMATE.start_sll_hierarchical_destroy_~head#1.base|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-12-14 05:15:16,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:15:16,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:15:16,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-12-14 05:15:16,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612239218] [2022-12-14 05:15:16,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:15:16,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 05:15:16,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 05:15:16,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 05:15:16,147 INFO L87 Difference]: Start difference. First operand 173 states and 212 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 05:15:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:15:16,605 INFO L93 Difference]: Finished difference Result 208 states and 249 transitions. [2022-12-14 05:15:16,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:15:16,606 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-12-14 05:15:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:15:16,607 INFO L225 Difference]: With dead ends: 208 [2022-12-14 05:15:16,607 INFO L226 Difference]: Without dead ends: 198 [2022-12-14 05:15:16,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 05:15:16,608 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 196 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:15:16,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 390 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 05:15:16,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-12-14 05:15:16,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2022-12-14 05:15:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 150 states have (on average 1.4266666666666667) internal successors, (214), 179 states have internal predecessors, (214), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 05:15:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions. [2022-12-14 05:15:16,612 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 35 [2022-12-14 05:15:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:15:16,612 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 234 transitions. [2022-12-14 05:15:16,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 05:15:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions. [2022-12-14 05:15:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 05:15:16,612 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:15:16,613 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:15:16,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 05:15:16,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 05:15:16,814 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:15:16,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:15:16,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1442707803, now seen corresponding path program 2 times [2022-12-14 05:15:16,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:15:16,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549474456] [2022-12-14 05:15:16,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:16,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:15:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:15:17,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:17,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549474456] [2022-12-14 05:15:17,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549474456] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:15:17,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671646981] [2022-12-14 05:15:17,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 05:15:17,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:15:17,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:15:17,049 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:15:17,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 05:15:17,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 05:15:17,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 05:15:17,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 05:15:17,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:15:17,418 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-12-14 05:15:17,509 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 16 treesize of output 8 [2022-12-14 05:15:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 05:15:17,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 05:15:17,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671646981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:15:17,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 05:15:17,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-12-14 05:15:17,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368511683] [2022-12-14 05:15:17,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:15:17,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 05:15:17,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:17,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 05:15:17,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-14 05:15:17,549 INFO L87 Difference]: Start difference. First operand 188 states and 234 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:15:18,128 INFO L93 Difference]: Finished difference Result 291 states and 362 transitions. [2022-12-14 05:15:18,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 05:15:18,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-12-14 05:15:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:15:18,130 INFO L225 Difference]: With dead ends: 291 [2022-12-14 05:15:18,130 INFO L226 Difference]: Without dead ends: 291 [2022-12-14 05:15:18,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2022-12-14 05:15:18,130 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 195 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:15:18,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 360 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:15:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-12-14 05:15:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 202. [2022-12-14 05:15:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 164 states have (on average 1.4451219512195121) internal successors, (237), 192 states have internal predecessors, (237), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 05:15:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 257 transitions. [2022-12-14 05:15:18,135 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 257 transitions. Word has length 38 [2022-12-14 05:15:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:15:18,135 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 257 transitions. [2022-12-14 05:15:18,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 257 transitions. [2022-12-14 05:15:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 05:15:18,136 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:15:18,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:15:18,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 05:15:18,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 05:15:18,337 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:15:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:15:18,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1438045390, now seen corresponding path program 1 times [2022-12-14 05:15:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:15:18,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465871385] [2022-12-14 05:15:18,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:15:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 05:15:18,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465871385] [2022-12-14 05:15:18,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465871385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:15:18,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:15:18,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 05:15:18,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473034238] [2022-12-14 05:15:18,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:15:18,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 05:15:18,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:18,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 05:15:18,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:15:18,565 INFO L87 Difference]: Start difference. First operand 202 states and 257 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:15:19,237 INFO L93 Difference]: Finished difference Result 341 states and 424 transitions. [2022-12-14 05:15:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 05:15:19,237 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-12-14 05:15:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:15:19,238 INFO L225 Difference]: With dead ends: 341 [2022-12-14 05:15:19,238 INFO L226 Difference]: Without dead ends: 341 [2022-12-14 05:15:19,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-14 05:15:19,239 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 188 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:15:19,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 320 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 05:15:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-12-14 05:15:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 206. [2022-12-14 05:15:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 169 states have (on average 1.4437869822485208) internal successors, (244), 196 states have internal predecessors, (244), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 05:15:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 264 transitions. [2022-12-14 05:15:19,244 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 264 transitions. Word has length 38 [2022-12-14 05:15:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:15:19,244 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 264 transitions. [2022-12-14 05:15:19,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 264 transitions. [2022-12-14 05:15:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 05:15:19,244 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:15:19,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:15:19,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 05:15:19,245 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:15:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:15:19,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1438045391, now seen corresponding path program 1 times [2022-12-14 05:15:19,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:15:19,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268672879] [2022-12-14 05:15:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:19,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:15:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 05:15:19,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:19,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268672879] [2022-12-14 05:15:19,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268672879] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:15:19,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174524049] [2022-12-14 05:15:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:19,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:15:19,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:15:19,426 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:15:19,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 05:15:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:19,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 05:15:19,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:15:19,672 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:15:19,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:15:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:15:20,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174524049] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 05:15:20,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [756236845] [2022-12-14 05:15:20,094 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-12-14 05:15:20,094 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 05:15:20,094 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 05:15:20,094 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 05:15:20,094 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 05:15:20,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:20,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:20,115 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-12-14 05:15:20,429 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-12-14 05:15:20,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-12-14 05:15:20,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:20,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-12-14 05:15:20,509 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-12-14 05:15:20,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 05:15:20,549 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:15:20,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:15:20,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-14 05:15:20,569 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 15 treesize of output 1 [2022-12-14 05:15:20,575 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-12-14 05:15:20,583 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-12-14 05:15:20,649 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-14 05:15:20,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-14 05:15:20,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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-12-14 05:15:20,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:15:20,718 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:15:20,718 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 197 treesize of output 196 [2022-12-14 05:15:20,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:15:20,744 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-12-14 05:15:20,745 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 233 treesize of output 232 [2022-12-14 05:15:20,771 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-12-14 05:15:20,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:20,840 INFO L321 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2022-12-14 05:15:20,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 233 treesize of output 235 [2022-12-14 05:15:20,942 INFO L321 Elim1Store]: treesize reduction 98, result has 26.9 percent of original size [2022-12-14 05:15:20,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 236 treesize of output 256 [2022-12-14 05:15:20,983 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-12-14 05:15:20,988 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 15 treesize of output 1 [2022-12-14 05:15:20,995 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-12-14 05:15:21,029 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:15:21,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 05:15:21,063 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:15:21,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:15:21,075 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-12-14 05:15:21,081 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 15 treesize of output 1 [2022-12-14 05:15:21,087 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-12-14 05:15:21,108 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-12-14 05:15:21,156 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 05:15:21,157 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 114 treesize of output 123 [2022-12-14 05:15:21,182 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-12-14 05:15:21,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:21,202 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 21 treesize of output 20 [2022-12-14 05:15:21,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:21,261 INFO L321 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2022-12-14 05:15:21,261 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 141 [2022-12-14 05:15:21,290 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-12-14 05:15:21,314 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-12-14 05:15:21,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:21,324 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 05:15:21,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:21,370 INFO L321 Elim1Store]: treesize reduction 51, result has 12.1 percent of original size [2022-12-14 05:15:21,370 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 143 [2022-12-14 05:15:21,425 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-12-14 05:15:21,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:21,553 INFO L321 Elim1Store]: treesize reduction 48, result has 50.5 percent of original size [2022-12-14 05:15:21,553 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 65 [2022-12-14 05:15:21,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:21,663 INFO L321 Elim1Store]: treesize reduction 142, result has 14.5 percent of original size [2022-12-14 05:15:21,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 152 treesize of output 153 [2022-12-14 05:15:21,833 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:15:21,834 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:15:22,006 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-12-14 05:15:22,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-12-14 05:15:22,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:22,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-12-14 05:15:22,144 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:15:22,146 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:15:22,147 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 05:15:22,331 INFO L321 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2022-12-14 05:15:22,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 173 [2022-12-14 05:15:22,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 05:15:22,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2022-12-14 05:15:22,409 INFO L197 IcfgInterpreter]: Interpreting procedure sll_append with input of size 30 for LOIs [2022-12-14 05:15:22,666 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-12-14 05:15:22,672 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-12-14 05:15:22,679 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 15 treesize of output 1 [2022-12-14 05:15:22,715 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 05:15:22,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-14 05:15:22,756 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:15:22,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-14 05:15:22,781 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-12-14 05:15:22,788 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 15 treesize of output 1 [2022-12-14 05:15:22,798 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-12-14 05:15:22,903 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-12-14 05:15:22,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:22,921 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 21 treesize of output 20 [2022-12-14 05:15:22,961 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-12-14 05:15:23,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:23,018 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 21 treesize of output 20 [2022-12-14 05:15:23,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:23,094 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 05:15:23,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 05:15:23,115 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-12-14 05:15:23,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:23,221 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 05:15:23,222 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 35 treesize of output 33 [2022-12-14 05:15:23,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:23,269 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-12-14 05:15:23,291 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-12-14 05:15:23,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:23,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:15:23,521 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-12-14 05:15:23,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 43 [2022-12-14 05:15:23,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:23,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:15:23,562 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-12-14 05:15:23,562 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2022-12-14 05:15:23,599 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-12-14 05:15:23,647 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 05:15:29,596 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7725#(and (= |ULTIMATE.start_main_~ptr~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#head~1#1.base|) |ULTIMATE.start_main_~#head~1#1.offset|)) (or (not (<= (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8) (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|))) (not (<= 0 (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#head~1#1.base|) |ULTIMATE.start_main_~#head~1#1.offset|) |ULTIMATE.start_main_~ptr~0#1.base|) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= 5 |ULTIMATE.start_main_~max~0#1|) (= |ULTIMATE.start_main_~#head~1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#head~1#1.base|) (= |ULTIMATE.start_main_~min~0#1| |ULTIMATE.start_main_~i~0#1|) (= 3 |ULTIMATE.start_main_~min~0#1|) (<= (+ |ULTIMATE.start_main_~#head~1#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#head~1#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#head~1#1.base|) 1) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~j~0#1| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 05:15:29,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 05:15:29,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 05:15:29,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-12-14 05:15:29,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742007007] [2022-12-14 05:15:29,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 05:15:29,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 05:15:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:29,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 05:15:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 05:15:29,597 INFO L87 Difference]: Start difference. First operand 206 states and 264 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:15:30,211 INFO L93 Difference]: Finished difference Result 251 states and 305 transitions. [2022-12-14 05:15:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 05:15:30,212 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-12-14 05:15:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:15:30,213 INFO L225 Difference]: With dead ends: 251 [2022-12-14 05:15:30,213 INFO L226 Difference]: Without dead ends: 241 [2022-12-14 05:15:30,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=231, Invalid=1251, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 05:15:30,213 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 187 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 05:15:30,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 496 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 05:15:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-12-14 05:15:30,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 212. [2022-12-14 05:15:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 175 states have (on average 1.4342857142857144) internal successors, (251), 202 states have internal predecessors, (251), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 05:15:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 271 transitions. [2022-12-14 05:15:30,218 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 271 transitions. Word has length 38 [2022-12-14 05:15:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:15:30,218 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 271 transitions. [2022-12-14 05:15:30,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 271 transitions. [2022-12-14 05:15:30,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 05:15:30,218 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:15:30,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:15:30,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 05:15:30,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:15:30,419 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:15:30,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:15:30,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1005877552, now seen corresponding path program 2 times [2022-12-14 05:15:30,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:15:30,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882472813] [2022-12-14 05:15:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:30,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:15:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:30,762 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-12-14 05:15:30,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:30,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882472813] [2022-12-14 05:15:30,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882472813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:15:30,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:15:30,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 05:15:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621397481] [2022-12-14 05:15:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:15:30,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 05:15:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 05:15:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 05:15:30,764 INFO L87 Difference]: Start difference. First operand 212 states and 271 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:15:31,462 INFO L93 Difference]: Finished difference Result 298 states and 378 transitions. [2022-12-14 05:15:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 05:15:31,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-12-14 05:15:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:15:31,464 INFO L225 Difference]: With dead ends: 298 [2022-12-14 05:15:31,464 INFO L226 Difference]: Without dead ends: 298 [2022-12-14 05:15:31,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-14 05:15:31,465 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 133 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 05:15:31,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 334 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 05:15:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-12-14 05:15:31,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 213. [2022-12-14 05:15:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 176 states have (on average 1.4261363636363635) internal successors, (251), 203 states have internal predecessors, (251), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 05:15:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 271 transitions. [2022-12-14 05:15:31,470 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 271 transitions. Word has length 41 [2022-12-14 05:15:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:15:31,470 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 271 transitions. [2022-12-14 05:15:31,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 271 transitions. [2022-12-14 05:15:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 05:15:31,470 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:15:31,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:15:31,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 05:15:31,471 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:15:31,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:15:31,471 INFO L85 PathProgramCache]: Analyzing trace with hash -280565302, now seen corresponding path program 1 times [2022-12-14 05:15:31,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:15:31,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148066030] [2022-12-14 05:15:31,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:31,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:15:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-14 05:15:32,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:32,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148066030] [2022-12-14 05:15:32,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148066030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:15:32,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:15:32,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 05:15:32,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040869378] [2022-12-14 05:15:32,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:15:32,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 05:15:32,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:32,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 05:15:32,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-12-14 05:15:32,369 INFO L87 Difference]: Start difference. First operand 213 states and 271 transitions. Second operand has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:15:33,784 INFO L93 Difference]: Finished difference Result 386 states and 483 transitions. [2022-12-14 05:15:33,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 05:15:33,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-12-14 05:15:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:15:33,785 INFO L225 Difference]: With dead ends: 386 [2022-12-14 05:15:33,785 INFO L226 Difference]: Without dead ends: 386 [2022-12-14 05:15:33,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2022-12-14 05:15:33,786 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 431 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 05:15:33,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 477 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 05:15:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-12-14 05:15:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 229. [2022-12-14 05:15:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.4375) internal successors, (276), 218 states have internal predecessors, (276), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 05:15:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 296 transitions. [2022-12-14 05:15:33,791 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 296 transitions. Word has length 43 [2022-12-14 05:15:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:15:33,792 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 296 transitions. [2022-12-14 05:15:33,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:33,792 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 296 transitions. [2022-12-14 05:15:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 05:15:33,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:15:33,792 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:15:33,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 05:15:33,792 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:15:33,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:15:33,793 INFO L85 PathProgramCache]: Analyzing trace with hash -280565301, now seen corresponding path program 1 times [2022-12-14 05:15:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:15:33,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783771561] [2022-12-14 05:15:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:15:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-14 05:15:35,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:35,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783771561] [2022-12-14 05:15:35,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783771561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 05:15:35,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 05:15:35,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 05:15:35,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129757296] [2022-12-14 05:15:35,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 05:15:35,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 05:15:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 05:15:35,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 05:15:35,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-12-14 05:15:35,047 INFO L87 Difference]: Start difference. First operand 229 states and 296 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 05:15:37,175 INFO L93 Difference]: Finished difference Result 433 states and 533 transitions. [2022-12-14 05:15:37,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 05:15:37,176 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-12-14 05:15:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 05:15:37,178 INFO L225 Difference]: With dead ends: 433 [2022-12-14 05:15:37,178 INFO L226 Difference]: Without dead ends: 433 [2022-12-14 05:15:37,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2022-12-14 05:15:37,178 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 526 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 05:15:37,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 412 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 05:15:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-12-14 05:15:37,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 229. [2022-12-14 05:15:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 192 states have (on average 1.4322916666666667) internal successors, (275), 218 states have internal predecessors, (275), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (12), 6 states have call predecessors, (12), 8 states have call successors, (12) [2022-12-14 05:15:37,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 295 transitions. [2022-12-14 05:15:37,186 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 295 transitions. Word has length 43 [2022-12-14 05:15:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 05:15:37,186 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 295 transitions. [2022-12-14 05:15:37,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 05:15:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 295 transitions. [2022-12-14 05:15:37,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 05:15:37,186 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 05:15:37,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 05:15:37,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 05:15:37,187 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [sll_appendErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, sll_appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-12-14 05:15:37,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 05:15:37,187 INFO L85 PathProgramCache]: Analyzing trace with hash 959802113, now seen corresponding path program 1 times [2022-12-14 05:15:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 05:15:37,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586752002] [2022-12-14 05:15:37,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:37,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 05:15:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 05:15:40,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 05:15:40,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586752002] [2022-12-14 05:15:40,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586752002] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 05:15:40,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044858720] [2022-12-14 05:15:40,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 05:15:40,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 05:15:40,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 05:15:40,191 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 05:15:40,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e7dc515b-d0af-497e-ba2b-76c64e28bee8/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 05:15:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 05:15:40,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-14 05:15:40,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 05:15:40,301 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-12-14 05:15:40,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-12-14 05:15:41,087 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 05:15:41,088 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-12-14 05:15:41,268 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-12-14 05:15:41,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 05:15:41,565 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 39 treesize of output 30 [2022-12-14 05:15:41,593 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-12-14 05:15:41,749 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 05:15:41,749 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 2 case distinctions, treesize of input 53 treesize of output 42 [2022-12-14 05:15:41,791 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 18 [2022-12-14 05:15:42,006 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 05:15:42,006 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 2 case distinctions, treesize of input 80 treesize of output 61 [2022-12-14 05:15:42,112 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 18 [2022-12-14 05:15:43,008 INFO L321 Elim1Store]: treesize reduction 68, result has 50.7 percent of original size [2022-12-14 05:15:43,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 94 treesize of output 118 [2022-12-14 05:15:43,064 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2022-12-14 05:15:43,064 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-12-14 05:15:44,073 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-14 05:15:44,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-14 05:15:45,914 INFO L321 Elim1Store]: treesize reduction 308, result has 32.6 percent of original size [2022-12-14 05:15:45,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 272 treesize of output 281 [2022-12-14 05:15:46,328 INFO L321 Elim1Store]: treesize reduction 188, result has 35.8 percent of original size [2022-12-14 05:15:46,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 34 case distinctions, treesize of input 180 treesize of output 230 [2022-12-14 05:16:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 05:16:38,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 05:16:40,589 INFO L321 Elim1Store]: treesize reduction 90, result has 9.1 percent of original size [2022-12-14 05:16:40,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 11049 treesize of output 10765 [2022-12-14 05:16:40,749 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 528 treesize of output 524 [2022-12-14 05:16:40,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:16:40,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:16:40,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 05:16:40,810 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-12-14 05:16:40,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 459 treesize of output 441 [2022-12-14 05:17:30,274 WARN L233 SmtUtils]: Spent 47.27s on a formula simplification. DAG size of input: 723 DAG size of output: 498 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-12-14 05:17:30,276 INFO L321 Elim1Store]: treesize reduction 9168, result has 52.5 percent of original size [2022-12-14 05:17:30,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 2 disjoint index pairs (out of 210 index pairs), introduced 27 new quantified variables, introduced 210 case distinctions, treesize of input 2213277 treesize of output 1846919 [2022-12-14 05:17:52,337 WARN L233 SmtUtils]: Spent 22.05s on a formula simplification. DAG size of input: 2772 DAG size of output: 2671 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-14 05:18:01,879 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 1729 DAG size of output: 1729 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)