./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- 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-38b53e6 [2022-11-25 23:36:25,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:36:25,323 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:36:25,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:36:25,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:36:25,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:36:25,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:36:25,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:36:25,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:36:25,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:36:25,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:36:25,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:36:25,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:36:25,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:36:25,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:36:25,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:36:25,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:36:25,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:36:25,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:36:25,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:36:25,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:36:25,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:36:25,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:36:25,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:36:25,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:36:25,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:36:25,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:36:25,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:36:25,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:36:25,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:36:25,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:36:25,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:36:25,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:36:25,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:36:25,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:36:25,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:36:25,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:36:25,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:36:25,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:36:25,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:36:25,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:36:25,399 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-25 23:36:25,426 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:36:25,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:36:25,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:36:25,428 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:36:25,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:36:25,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:36:25,429 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:36:25,429 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:36:25,430 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:36:25,430 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:36:25,430 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:36:25,431 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:36:25,431 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:36:25,431 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:36:25,432 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:36:25,432 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:36:25,432 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:36:25,432 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:36:25,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:36:25,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:36:25,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:36:25,434 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:36:25,435 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:36:25,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:36:25,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:36:25,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:36:25,436 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:36:25,436 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:36:25,436 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:36:25,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:36:25,437 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:36:25,437 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:36:25,438 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:36:25,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:36:25,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:36:25,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:36:25,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:36:25,439 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:36:25,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:36:25,440 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:36:25,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:36:25,441 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:36:25,441 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_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/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_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-11-25 23:36:25,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:36:25,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:36:25,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:36:25,720 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:36:25,721 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:36:25,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-25 23:36:28,902 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:36:29,194 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:36:29,195 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-25 23:36:29,213 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/data/50b8d5e7f/4182b2d181b040bf88da6ede1704528a/FLAG9b46f2e52 [2022-11-25 23:36:29,231 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/data/50b8d5e7f/4182b2d181b040bf88da6ede1704528a [2022-11-25 23:36:29,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:36:29,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:36:29,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:36:29,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:36:29,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:36:29,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@244fb7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29, skipping insertion in model container [2022-11-25 23:36:29,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:36:29,301 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:36:29,625 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_04f6a1a2-4f7f-4843-b67c-7946717d4200/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-25 23:36:29,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:36:29,638 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:36:29,679 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_04f6a1a2-4f7f-4843-b67c-7946717d4200/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-25 23:36:29,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:36:29,706 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:36:29,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29 WrapperNode [2022-11-25 23:36:29,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:36:29,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:36:29,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:36:29,709 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:36:29,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,780 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-11-25 23:36:29,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:36:29,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:36:29,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:36:29,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:36:29,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,796 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,810 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:36:29,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:36:29,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:36:29,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:36:29,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (1/1) ... [2022-11-25 23:36:29,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:36:29,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:29,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:36:29,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:36:29,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:36:29,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:36:29,926 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-25 23:36:29,926 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-25 23:36:29,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:36:29,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:36:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:36:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:36:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:36:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:36:29,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:36:29,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:36:30,147 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:36:30,150 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:36:30,480 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:36:30,618 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:36:30,618 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-25 23:36:30,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:36:30 BoogieIcfgContainer [2022-11-25 23:36:30,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:36:30,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:36:30,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:36:30,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:36:30,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:36:29" (1/3) ... [2022-11-25 23:36:30,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7bd247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:36:30, skipping insertion in model container [2022-11-25 23:36:30,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:36:29" (2/3) ... [2022-11-25 23:36:30,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7bd247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:36:30, skipping insertion in model container [2022-11-25 23:36:30,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:36:30" (3/3) ... [2022-11-25 23:36:30,630 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-11-25 23:36:30,650 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:36:30,650 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-25 23:36:30,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:36:30,698 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;@5afaf69e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:36:30,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-11-25 23:36:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 33 states have (on average 2.121212121212121) internal successors, (70), 61 states have internal predecessors, (70), 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-11-25 23:36:30,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:36:30,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:30,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:36:30,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:30,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:30,718 INFO L85 PathProgramCache]: Analyzing trace with hash 198170915, now seen corresponding path program 1 times [2022-11-25 23:36:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:30,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813915857] [2022-11-25 23:36:30,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:30,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:31,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:31,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813915857] [2022-11-25 23:36:31,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813915857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:31,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:31,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:36:31,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899796665] [2022-11-25 23:36:31,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:31,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:31,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:31,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:31,074 INFO L87 Difference]: Start difference. First operand has 65 states, 33 states have (on average 2.121212121212121) internal successors, (70), 61 states have internal predecessors, (70), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-25 23:36:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:31,232 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-11-25 23:36:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:31,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2022-11-25 23:36:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:31,242 INFO L225 Difference]: With dead ends: 63 [2022-11-25 23:36:31,243 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 23:36:31,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:31,248 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:31,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 23:36:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-25 23:36:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 32 states have (on average 2.0) internal successors, (64), 57 states have internal predecessors, (64), 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-11-25 23:36:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-11-25 23:36:31,288 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 5 [2022-11-25 23:36:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:31,288 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-11-25 23:36:31,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-25 23:36:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-11-25 23:36:31,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:36:31,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:31,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:36:31,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:36:31,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash 198170916, now seen corresponding path program 1 times [2022-11-25 23:36:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:31,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330385489] [2022-11-25 23:36:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:31,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:31,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330385489] [2022-11-25 23:36:31,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330385489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:31,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:31,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:36:31,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945075625] [2022-11-25 23:36:31,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:31,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:31,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:31,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:31,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:31,424 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-25 23:36:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:31,493 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-11-25 23:36:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:31,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2022-11-25 23:36:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:31,495 INFO L225 Difference]: With dead ends: 59 [2022-11-25 23:36:31,495 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 23:36:31,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:31,497 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:31,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 23:36:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 23:36:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.9375) internal successors, (62), 55 states have internal predecessors, (62), 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-11-25 23:36:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-25 23:36:31,508 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 5 [2022-11-25 23:36:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:31,508 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-25 23:36:31,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-25 23:36:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-25 23:36:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:36:31,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:31,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:31,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:36:31,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:31,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1927971198, now seen corresponding path program 1 times [2022-11-25 23:36:31,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:31,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108487241] [2022-11-25 23:36:31,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:31,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:31,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108487241] [2022-11-25 23:36:31,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108487241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:31,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:31,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:36:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299938105] [2022-11-25 23:36:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:31,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:36:31,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:31,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:36:31,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:31,635 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-25 23:36:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:31,685 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-11-25 23:36:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:36:31,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2022-11-25 23:36:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:31,687 INFO L225 Difference]: With dead ends: 65 [2022-11-25 23:36:31,687 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:36:31,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:36:31,689 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:31,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:36:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:36:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-11-25 23:36:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 56 states have internal predecessors, (63), 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-11-25 23:36:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-11-25 23:36:31,698 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 10 [2022-11-25 23:36:31,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:31,699 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-11-25 23:36:31,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-11-25 23:36:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-11-25 23:36:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:36:31,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:31,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:31,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:36:31,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:31,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:31,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1377774572, now seen corresponding path program 1 times [2022-11-25 23:36:31,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:31,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594663526] [2022-11-25 23:36:31,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:31,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:36:31,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:31,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594663526] [2022-11-25 23:36:31,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594663526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:31,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:31,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:36:31,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499546361] [2022-11-25 23:36:31,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:31,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:36:31,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:31,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:36:31,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:31,971 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:36:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:32,150 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2022-11-25 23:36:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:36:32,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-11-25 23:36:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:32,159 INFO L225 Difference]: With dead ends: 79 [2022-11-25 23:36:32,159 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 23:36:32,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:36:32,168 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:32,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 140 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 23:36:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 59. [2022-11-25 23:36:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.878787878787879) internal successors, (62), 55 states have internal predecessors, (62), 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-11-25 23:36:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2022-11-25 23:36:32,183 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 17 [2022-11-25 23:36:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:32,184 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2022-11-25 23:36:32,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:36:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-11-25 23:36:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:36:32,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:32,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:32,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:36:32,185 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:32,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1377774571, now seen corresponding path program 1 times [2022-11-25 23:36:32,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:32,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175567253] [2022-11-25 23:36:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:32,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:36:32,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:32,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175567253] [2022-11-25 23:36:32,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175567253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:32,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:32,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:36:32,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478897356] [2022-11-25 23:36:32,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:32,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:36:32,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:32,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:36:32,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:36:32,553 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:36:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:32,696 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-11-25 23:36:32,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:36:32,696 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-11-25 23:36:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:32,697 INFO L225 Difference]: With dead ends: 59 [2022-11-25 23:36:32,698 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 23:36:32,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:36:32,699 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:32,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 149 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:32,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 23:36:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-11-25 23:36:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 54 states have internal predecessors, (61), 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-11-25 23:36:32,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-11-25 23:36:32,704 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 17 [2022-11-25 23:36:32,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:32,704 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-11-25 23:36:32,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:36:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-11-25 23:36:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:36:32,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:32,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:32,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:36:32,706 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:32,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1191271115, now seen corresponding path program 1 times [2022-11-25 23:36:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:32,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344698512] [2022-11-25 23:36:32,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:32,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:36:32,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:32,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344698512] [2022-11-25 23:36:32,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344698512] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:32,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404263173] [2022-11-25 23:36:32,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:32,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:32,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:32,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:32,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:36:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:33,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 23:36:33,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:33,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:36:33,241 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_144 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_144))) is different from true [2022-11-25 23:36:33,263 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_144 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_144))) is different from true [2022-11-25 23:36:33,321 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:36:33,322 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-11-25 23:36:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-25 23:36:33,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:36:33,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404263173] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:36:33,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [915143025] [2022-11-25 23:36:33,776 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 23:36:33,777 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:36:33,782 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:36:33,788 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:36:33,789 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:33,879 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-11-25 23:36:33,885 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-11-25 23:36:33,903 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-11-25 23:36:33,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:33,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:33,932 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 13 treesize of output 9 [2022-11-25 23:36:33,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:33,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:36:33,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:33,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:36:34,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:36:34,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:36:34,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:36:34,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:34,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:34,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:34,576 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:34,579 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:34,582 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:34,584 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:34,586 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:34,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:36:34,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:34,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:34,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:36:34,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:35,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:36:35,032 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:35,034 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:35,047 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:35,049 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:35,053 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:35,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:36:35,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:36:35,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:35,148 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 23 treesize of output 11 [2022-11-25 23:36:35,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:35,450 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 127 treesize of output 111 [2022-11-25 23:36:35,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:35,466 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 0 case distinctions, treesize of input 123 treesize of output 111 [2022-11-25 23:36:35,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:35,480 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 0 case distinctions, treesize of input 115 treesize of output 103 [2022-11-25 23:36:35,781 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:36:35,963 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:36:38,048 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '842#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-25 23:36:38,048 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:36:38,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:36:38,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-11-25 23:36:38,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084812885] [2022-11-25 23:36:38,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:36:38,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 23:36:38,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:38,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 23:36:38,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=698, Unknown=3, NotChecked=110, Total=930 [2022-11-25 23:36:38,051 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:36:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:38,343 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-25 23:36:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:36:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2022-11-25 23:36:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:38,345 INFO L225 Difference]: With dead ends: 76 [2022-11-25 23:36:38,345 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 23:36:38,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=130, Invalid=745, Unknown=3, NotChecked=114, Total=992 [2022-11-25 23:36:38,346 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 190 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:38,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 276 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2022-11-25 23:36:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 23:36:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-11-25 23:36:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 53 states have internal predecessors, (60), 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-11-25 23:36:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-11-25 23:36:38,376 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 19 [2022-11-25 23:36:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:38,377 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-11-25 23:36:38,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:36:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-11-25 23:36:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:36:38,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:38,385 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:38,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:38,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:38,591 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1191271114, now seen corresponding path program 1 times [2022-11-25 23:36:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:38,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863896914] [2022-11-25 23:36:38,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:38,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:38,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:36:38,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:38,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863896914] [2022-11-25 23:36:38,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863896914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:38,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362227523] [2022-11-25 23:36:38,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:38,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:38,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:38,925 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:38,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:36:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:39,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 23:36:39,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:39,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:36:39,310 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:36:39,310 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 14 treesize of output 20 [2022-11-25 23:36:39,325 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:36:39,326 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 11 treesize of output 11 [2022-11-25 23:36:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:39,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:39,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362227523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:39,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [679792215] [2022-11-25 23:36:39,563 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 23:36:39,563 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:36:39,563 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:36:39,563 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:36:39,563 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:39,584 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-11-25 23:36:39,589 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-11-25 23:36:39,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:39,606 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-11-25 23:36:39,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:39,619 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 13 treesize of output 9 [2022-11-25 23:36:39,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:39,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:36:39,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:39,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:36:39,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:36:40,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:40,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:36:40,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:36:40,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:40,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:40,053 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:40,054 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:40,057 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:40,060 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:40,061 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:40,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:36:40,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:40,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:40,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:36:40,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:36:40,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:40,360 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:40,362 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:40,364 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:40,366 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:40,368 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:40,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:36:40,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:36:40,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:40,439 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 23 treesize of output 11 [2022-11-25 23:36:40,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:40,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:40,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:40,754 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:36:40,933 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:36:43,073 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1079#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (< (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-25 23:36:43,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:36:43,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:36:43,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2022-11-25 23:36:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014101191] [2022-11-25 23:36:43,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:36:43,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 23:36:43,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:43,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 23:36:43,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:36:43,077 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:36:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:43,772 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-25 23:36:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:36:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2022-11-25 23:36:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:43,774 INFO L225 Difference]: With dead ends: 77 [2022-11-25 23:36:43,774 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 23:36:43,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 23:36:43,775 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 116 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:43,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 271 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:36:43,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 23:36:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-11-25 23:36:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 52 states have internal predecessors, (59), 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-11-25 23:36:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-11-25 23:36:43,781 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 19 [2022-11-25 23:36:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:43,781 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-11-25 23:36:43,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:36:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-11-25 23:36:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:36:43,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:43,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:43,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:43,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:43,989 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:43,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash 161846627, now seen corresponding path program 1 times [2022-11-25 23:36:43,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:43,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799601962] [2022-11-25 23:36:43,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:43,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:36:44,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:44,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799601962] [2022-11-25 23:36:44,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799601962] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:44,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:44,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:36:44,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321477041] [2022-11-25 23:36:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:44,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:36:44,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:44,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:36:44,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:36:44,212 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:36:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:44,476 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2022-11-25 23:36:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:36:44,477 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-25 23:36:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:44,477 INFO L225 Difference]: With dead ends: 116 [2022-11-25 23:36:44,478 INFO L226 Difference]: Without dead ends: 116 [2022-11-25 23:36:44,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:36:44,478 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 201 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:44,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 251 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:36:44,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-25 23:36:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 59. [2022-11-25 23:36:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 55 states have internal predecessors, (65), 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-11-25 23:36:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-11-25 23:36:44,484 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 22 [2022-11-25 23:36:44,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:44,484 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-11-25 23:36:44,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:36:44,485 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-11-25 23:36:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:36:44,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:44,486 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:44,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:36:44,486 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:44,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:44,491 INFO L85 PathProgramCache]: Analyzing trace with hash 161846628, now seen corresponding path program 1 times [2022-11-25 23:36:44,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:44,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798819406] [2022-11-25 23:36:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:44,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:36:44,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:44,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798819406] [2022-11-25 23:36:44,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798819406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:44,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233494448] [2022-11-25 23:36:44,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:44,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:44,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:44,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:44,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:36:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:44,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:36:44,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:36:44,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:36:44,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233494448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:44,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:36:44,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-11-25 23:36:44,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463208698] [2022-11-25 23:36:44,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:44,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:36:44,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:44,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:36:44,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:36:44,812 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:36:44,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:44,902 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2022-11-25 23:36:44,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:36:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-25 23:36:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:44,906 INFO L225 Difference]: With dead ends: 80 [2022-11-25 23:36:44,906 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 23:36:44,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:36:44,909 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 95 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:44,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 130 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:36:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 23:36:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2022-11-25 23:36:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 58 states have internal predecessors, (68), 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-11-25 23:36:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-11-25 23:36:44,933 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 22 [2022-11-25 23:36:44,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:44,934 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-11-25 23:36:44,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:36:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-11-25 23:36:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:36:44,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:44,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:44,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:45,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:45,141 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:45,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:45,142 INFO L85 PathProgramCache]: Analyzing trace with hash 161842064, now seen corresponding path program 1 times [2022-11-25 23:36:45,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:45,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890383530] [2022-11-25 23:36:45,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:36:45,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:45,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890383530] [2022-11-25 23:36:45,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890383530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:36:45,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:36:45,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:36:45,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952196626] [2022-11-25 23:36:45,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:36:45,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:36:45,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:45,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:36:45,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:36:45,436 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:36:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:45,714 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-11-25 23:36:45,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:36:45,714 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-25 23:36:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:45,715 INFO L225 Difference]: With dead ends: 99 [2022-11-25 23:36:45,715 INFO L226 Difference]: Without dead ends: 99 [2022-11-25 23:36:45,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:36:45,716 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 194 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:45,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 275 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:36:45,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-25 23:36:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 62. [2022-11-25 23:36:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 58 states have internal predecessors, (66), 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-11-25 23:36:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-11-25 23:36:45,720 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 22 [2022-11-25 23:36:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:45,720 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-11-25 23:36:45,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:36:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-11-25 23:36:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:36:45,721 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:45,721 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:45,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:36:45,721 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:45,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash 911528901, now seen corresponding path program 1 times [2022-11-25 23:36:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:45,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190223948] [2022-11-25 23:36:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:45,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:46,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:46,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190223948] [2022-11-25 23:36:46,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190223948] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:46,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578408507] [2022-11-25 23:36:46,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:46,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:46,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:46,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:46,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:36:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 23:36:46,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:46,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:36:46,321 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:36:46,322 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 11 treesize of output 11 [2022-11-25 23:36:46,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:46,357 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:36:46,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 23:36:46,449 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 25 treesize of output 13 [2022-11-25 23:36:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:46,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:46,477 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-25 23:36:46,477 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 19 treesize of output 18 [2022-11-25 23:36:46,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578408507] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:46,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1815122382] [2022-11-25 23:36:46,584 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-25 23:36:46,584 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:36:46,584 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:36:46,585 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:36:46,585 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:46,613 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-11-25 23:36:46,617 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-11-25 23:36:46,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:46,628 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-11-25 23:36:46,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:46,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:46,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:36:46,650 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 13 treesize of output 9 [2022-11-25 23:36:46,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:46,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:36:46,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:36:46,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:46,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:46,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:46,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:46,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:46,986 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:46,988 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:46,991 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:46,993 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:47,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:36:47,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:47,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:47,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:47,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:47,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:47,263 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:47,266 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:47,269 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:47,271 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:47,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:36:47,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:47,330 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 23 treesize of output 11 [2022-11-25 23:36:47,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:36:47,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:47,525 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 127 treesize of output 111 [2022-11-25 23:36:47,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:47,547 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 0 case distinctions, treesize of input 123 treesize of output 111 [2022-11-25 23:36:47,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:47,558 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 0 case distinctions, treesize of input 119 treesize of output 107 [2022-11-25 23:36:47,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:47,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:47,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:48,087 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:36:48,253 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:36:51,440 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1941#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= 3 |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 3 |ULTIMATE.start_sll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_main_~new_data~0#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= 1 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:36:51,441 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:36:51,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:36:51,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2022-11-25 23:36:51,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325167983] [2022-11-25 23:36:51,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:36:51,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 23:36:51,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:51,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 23:36:51,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1021, Unknown=3, NotChecked=0, Total=1122 [2022-11-25 23:36:51,443 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 17 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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-11-25 23:36:51,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:36:51,954 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-11-25 23:36:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:36:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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) Word has length 24 [2022-11-25 23:36:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:36:51,956 INFO L225 Difference]: With dead ends: 102 [2022-11-25 23:36:51,956 INFO L226 Difference]: Without dead ends: 102 [2022-11-25 23:36:51,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=133, Invalid=1346, Unknown=3, NotChecked=0, Total=1482 [2022-11-25 23:36:51,957 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 88 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:36:51,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 395 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:36:51,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-25 23:36:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 73. [2022-11-25 23:36:51,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 68 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:36:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 86 transitions. [2022-11-25 23:36:51,963 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 86 transitions. Word has length 24 [2022-11-25 23:36:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:36:51,963 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 86 transitions. [2022-11-25 23:36:51,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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-11-25 23:36:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-11-25 23:36:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:36:51,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:36:51,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:36:51,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:36:52,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 23:36:52,172 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:36:52,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:36:52,172 INFO L85 PathProgramCache]: Analyzing trace with hash 911528902, now seen corresponding path program 1 times [2022-11-25 23:36:52,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:36:52,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661536492] [2022-11-25 23:36:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:36:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:53,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:36:53,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661536492] [2022-11-25 23:36:53,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661536492] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:53,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016842573] [2022-11-25 23:36:53,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:36:53,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:36:53,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:36:53,040 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:36:53,074 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:36:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:36:53,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-25 23:36:53,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:36:53,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:36:53,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:36:53,428 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:36:53,429 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 11 treesize of output 11 [2022-11-25 23:36:53,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:53,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:53,602 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:36:53,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-25 23:36:53,606 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 18 treesize of output 20 [2022-11-25 23:36:53,704 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 25 treesize of output 13 [2022-11-25 23:36:53,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-25 23:36:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:36:53,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:36:53,888 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_553 (Array Int Int)) (v_ArrVal_554 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_554 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_554) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-11-25 23:36:53,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:53,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-25 23:36:53,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:53,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-25 23:36:53,932 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 52 treesize of output 44 [2022-11-25 23:36:53,940 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 82 treesize of output 70 [2022-11-25 23:36:53,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-11-25 23:36:53,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-25 23:36:53,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:36:53,998 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-25 23:36:54,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:54,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2022-11-25 23:36:54,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016842573] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:36:54,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [909418015] [2022-11-25 23:36:54,240 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-25 23:36:54,240 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:36:54,241 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:36:54,241 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:36:54,241 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:36:54,261 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-11-25 23:36:54,266 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-11-25 23:36:54,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:54,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:54,284 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-11-25 23:36:54,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:54,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:36:54,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:54,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:36:54,308 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 13 treesize of output 9 [2022-11-25 23:36:54,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:36:54,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:54,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:54,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:36:54,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:36:54,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:54,581 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:54,583 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:54,584 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:54,587 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:54,589 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:54,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:36:54,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:54,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:54,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:36:54,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:54,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:36:54,780 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:54,782 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:54,784 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:54,785 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:54,787 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:36:54,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:54,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:54,908 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-25 23:36:54,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:54,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-25 23:36:54,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:54,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 222 [2022-11-25 23:36:55,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:55,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:36:55,071 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 114 [2022-11-25 23:36:55,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:55,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-11-25 23:36:55,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:36:55,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 108 [2022-11-25 23:36:55,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:36:55,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 11 treesize of output 7 [2022-11-25 23:36:55,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:36:55,459 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:36:55,624 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:36:59,967 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2275#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= (+ |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= (+ |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|)) (or (not (<= (+ 8 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_update_at_~head#1.base|))) (not (<= 0 (+ 4 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)))) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_create_#res#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (< 0 (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (<= 1 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|) (= |#NULL.base| 0))' at error location [2022-11-25 23:36:59,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:36:59,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:36:59,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2022-11-25 23:36:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564343014] [2022-11-25 23:36:59,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:36:59,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:36:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:36:59,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:36:59,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2097, Unknown=5, NotChecked=92, Total=2352 [2022-11-25 23:36:59,975 INFO L87 Difference]: Start difference. First operand 73 states and 86 transitions. Second operand has 26 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 21 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:37:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:01,012 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2022-11-25 23:37:01,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:37:01,012 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 21 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-11-25 23:37:01,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:01,013 INFO L225 Difference]: With dead ends: 117 [2022-11-25 23:37:01,013 INFO L226 Difference]: Without dead ends: 117 [2022-11-25 23:37:01,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=207, Invalid=2548, Unknown=5, NotChecked=102, Total=2862 [2022-11-25 23:37:01,015 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 125 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:01,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 615 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:37:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-25 23:37:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2022-11-25 23:37:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.608695652173913) internal successors, (74), 65 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:37:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-11-25 23:37:01,019 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 24 [2022-11-25 23:37:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:01,020 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-11-25 23:37:01,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 21 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:37:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-11-25 23:37:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:37:01,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:01,022 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:01,032 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:01,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:01,232 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:37:01,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:01,233 INFO L85 PathProgramCache]: Analyzing trace with hash -198311513, now seen corresponding path program 2 times [2022-11-25 23:37:01,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:01,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901885355] [2022-11-25 23:37:01,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:01,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:37:01,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:01,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901885355] [2022-11-25 23:37:01,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901885355] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:01,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757727236] [2022-11-25 23:37:01,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:37:01,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:01,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:01,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:01,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:37:01,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:37:01,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:37:01,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:37:01,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:37:01,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:37:01,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757727236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:01,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:37:01,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2022-11-25 23:37:01,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142104258] [2022-11-25 23:37:01,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:01,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:37:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:01,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:37:01,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:37:01,680 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:37:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:01,746 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-11-25 23:37:01,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:37:01,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-25 23:37:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:01,748 INFO L225 Difference]: With dead ends: 68 [2022-11-25 23:37:01,748 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 23:37:01,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:37:01,750 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 175 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:01,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 65 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:37:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 23:37:01,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-25 23:37:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:37:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-11-25 23:37:01,759 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 26 [2022-11-25 23:37:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:01,759 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-11-25 23:37:01,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:37:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-11-25 23:37:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 23:37:01,764 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:01,764 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:01,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:01,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 23:37:01,970 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:37:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:01,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1675971377, now seen corresponding path program 1 times [2022-11-25 23:37:01,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:01,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944262155] [2022-11-25 23:37:01,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:37:02,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:02,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944262155] [2022-11-25 23:37:02,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944262155] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:02,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:02,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:37:02,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901863235] [2022-11-25 23:37:02,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:02,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:37:02,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:02,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:37:02,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:37:02,141 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:37:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:02,349 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2022-11-25 23:37:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:37:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-25 23:37:02,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:02,351 INFO L225 Difference]: With dead ends: 92 [2022-11-25 23:37:02,351 INFO L226 Difference]: Without dead ends: 92 [2022-11-25 23:37:02,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:37:02,352 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 179 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:02,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 165 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:37:02,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-25 23:37:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2022-11-25 23:37:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.5714285714285714) internal successors, (77), 66 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:37:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2022-11-25 23:37:02,357 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 28 [2022-11-25 23:37:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:02,357 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2022-11-25 23:37:02,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:37:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-11-25 23:37:02,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 23:37:02,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:02,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:02,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 23:37:02,361 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:37:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:02,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1675971376, now seen corresponding path program 1 times [2022-11-25 23:37:02,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:02,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063826685] [2022-11-25 23:37:02,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:02,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:37:02,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:02,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063826685] [2022-11-25 23:37:02,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063826685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:02,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669465597] [2022-11-25 23:37:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:02,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:02,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:02,474 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:02,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:37:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:02,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:37:02,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:37:02,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:37:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:37:02,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669465597] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:37:02,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [330173680] [2022-11-25 23:37:02,688 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2022-11-25 23:37:02,689 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:37:02,689 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:37:02,689 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:37:02,689 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:37:02,706 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-11-25 23:37:02,710 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-11-25 23:37:02,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:02,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:02,725 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-11-25 23:37:02,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:02,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:37:02,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:02,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:37:02,745 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 13 treesize of output 9 [2022-11-25 23:37:02,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:02,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:02,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:02,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:02,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:02,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:02,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:02,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:02,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:02,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:03,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:03,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:03,022 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 23 treesize of output 11 [2022-11-25 23:37:03,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:03,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:03,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:03,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:03,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:03,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:03,246 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 23 treesize of output 11 [2022-11-25 23:37:03,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:03,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:03,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:03,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:03,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:03,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:03,546 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:37:03,547 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:37:03,573 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:37:03,574 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:37:03,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 23:37:04,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:04,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:04,227 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-25 23:37:04,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 389 [2022-11-25 23:37:04,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:04,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:04,306 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-25 23:37:04,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 389 [2022-11-25 23:37:04,349 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:37:04,350 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 405 treesize of output 404 [2022-11-25 23:37:04,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:37:04,725 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:37:04,725 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 158 treesize of output 152 [2022-11-25 23:37:04,764 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:37:04,765 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 154 treesize of output 148 [2022-11-25 23:37:05,064 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-11-25 23:37:05,282 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:37:11,347 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3063#(and (not (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|))) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (= |#NULL.base| 0))' at error location [2022-11-25 23:37:11,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:37:11,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:37:11,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-11-25 23:37:11,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788785931] [2022-11-25 23:37:11,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:37:11,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:37:11,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:11,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:37:11,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=508, Unknown=1, NotChecked=0, Total=600 [2022-11-25 23:37:11,349 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:37:11,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:11,542 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2022-11-25 23:37:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:37:11,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-11-25 23:37:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:11,545 INFO L225 Difference]: With dead ends: 87 [2022-11-25 23:37:11,545 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 23:37:11,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=129, Invalid=682, Unknown=1, NotChecked=0, Total=812 [2022-11-25 23:37:11,546 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 104 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:11,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 163 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:11,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 23:37:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2022-11-25 23:37:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 76 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:37:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2022-11-25 23:37:11,550 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 28 [2022-11-25 23:37:11,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:11,550 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2022-11-25 23:37:11,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:37:11,550 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2022-11-25 23:37:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 23:37:11,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:11,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:11,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:11,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:37:11,758 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:37:11,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:11,759 INFO L85 PathProgramCache]: Analyzing trace with hash -562101260, now seen corresponding path program 1 times [2022-11-25 23:37:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:11,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258271717] [2022-11-25 23:37:11,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:11,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:37:11,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:11,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258271717] [2022-11-25 23:37:11,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258271717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:11,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873999288] [2022-11-25 23:37:11,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:11,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:11,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:11,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:11,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:37:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:12,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:37:12,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:37:12,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:37:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:37:12,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873999288] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:37:12,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [306149863] [2022-11-25 23:37:12,159 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-25 23:37:12,159 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:37:12,159 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:37:12,159 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:37:12,160 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:37:12,181 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-11-25 23:37:12,185 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-11-25 23:37:12,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:12,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:12,203 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-11-25 23:37:12,210 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 13 treesize of output 9 [2022-11-25 23:37:12,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:12,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:37:12,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:12,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:37:12,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:12,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:12,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:12,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:12,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:12,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:12,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:12,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:12,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:12,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:12,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:12,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:12,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:12,510 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 23 treesize of output 11 [2022-11-25 23:37:12,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:37:12,761 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:12,763 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:12,765 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:12,767 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:12,770 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:12,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:12,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:12,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:12,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:12,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:12,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:37:12,995 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:12,997 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:12,998 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,000 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,003 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:13,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:13,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:13,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:13,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:13,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:13,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:13,143 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 23 treesize of output 11 [2022-11-25 23:37:13,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:13,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:37:13,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:13,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:13,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:13,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:13,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:13,453 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,462 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,464 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,467 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:37:13,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:13,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:13,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:13,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:13,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:13,672 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,673 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,678 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,679 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:13,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:37:13,886 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:37:13,887 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:37:13,912 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:37:13,912 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:37:13,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:13,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 23:37:14,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:14,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:14,532 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-25 23:37:14,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 393 [2022-11-25 23:37:14,580 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:37:14,581 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 405 treesize of output 404 [2022-11-25 23:37:14,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:14,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:14,656 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-25 23:37:14,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 403 treesize of output 381 [2022-11-25 23:37:15,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:37:15,154 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:37:15,155 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 158 treesize of output 152 [2022-11-25 23:37:15,200 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:37:15,200 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 154 treesize of output 148 [2022-11-25 23:37:15,536 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-25 23:37:15,747 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:37:21,463 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3434#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (or (and (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_update_at_~index#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|) (= |#NULL.base| 0)) (and (< 0 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= |ULTIMATE.start_sll_circular_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_#in~index#1| (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= (+ |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|)) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~new_data~0#1|) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_sll_circular_update_at_~data#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_update_at_#in~data#1| |ULTIMATE.start_main_~new_data~0#1|) (= |#NULL.base| 0))) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0))' at error location [2022-11-25 23:37:21,463 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:37:21,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:37:21,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2022-11-25 23:37:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362104190] [2022-11-25 23:37:21,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:37:21,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 23:37:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:21,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 23:37:21,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=466, Unknown=2, NotChecked=0, Total=552 [2022-11-25 23:37:21,465 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:37:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:21,608 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2022-11-25 23:37:21,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:37:21,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-11-25 23:37:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:21,609 INFO L225 Difference]: With dead ends: 87 [2022-11-25 23:37:21,609 INFO L226 Difference]: Without dead ends: 87 [2022-11-25 23:37:21,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=96, Invalid=552, Unknown=2, NotChecked=0, Total=650 [2022-11-25 23:37:21,610 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 184 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:21,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 162 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-25 23:37:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2022-11-25 23:37:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 76 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:37:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2022-11-25 23:37:21,622 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 29 [2022-11-25 23:37:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:21,623 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2022-11-25 23:37:21,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:37:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2022-11-25 23:37:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 23:37:21,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:21,625 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:21,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:21,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:37:21,830 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:37:21,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:21,831 INFO L85 PathProgramCache]: Analyzing trace with hash 909400029, now seen corresponding path program 2 times [2022-11-25 23:37:21,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:21,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254043852] [2022-11-25 23:37:21,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:37:22,163 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:22,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254043852] [2022-11-25 23:37:22,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254043852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:22,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:37:22,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:37:22,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647334597] [2022-11-25 23:37:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:22,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:37:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:22,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:37:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:37:22,166 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:37:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:22,379 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2022-11-25 23:37:22,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:37:22,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-11-25 23:37:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:22,381 INFO L225 Difference]: With dead ends: 110 [2022-11-25 23:37:22,381 INFO L226 Difference]: Without dead ends: 110 [2022-11-25 23:37:22,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:37:22,382 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 262 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:22,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 170 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:37:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-25 23:37:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 81. [2022-11-25 23:37:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 76 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:37:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2022-11-25 23:37:22,385 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 31 [2022-11-25 23:37:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:22,385 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2022-11-25 23:37:22,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:37:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2022-11-25 23:37:22,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:37:22,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:22,387 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:22,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 23:37:22,387 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:37:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1018086712, now seen corresponding path program 3 times [2022-11-25 23:37:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:22,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076615040] [2022-11-25 23:37:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:22,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:37:22,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:22,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076615040] [2022-11-25 23:37:22,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076615040] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:22,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374670823] [2022-11-25 23:37:22,481 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:37:22,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:22,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:22,483 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:22,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:37:22,661 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:37:22,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:37:22,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-25 23:37:22,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:22,740 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:37:22,741 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-11-25 23:37:22,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:22,845 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 23:37:22,846 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 29 treesize of output 32 [2022-11-25 23:37:22,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:22,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:37:22,962 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 29 [2022-11-25 23:37:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:37:22,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:37:23,149 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 142 treesize of output 134 [2022-11-25 23:37:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:37:23,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374670823] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:37:23,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [546229010] [2022-11-25 23:37:23,714 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-25 23:37:23,714 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:37:23,715 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:37:23,715 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:37:23,715 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:37:23,730 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-11-25 23:37:23,736 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-11-25 23:37:23,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:23,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:23,753 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-11-25 23:37:23,760 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 13 treesize of output 9 [2022-11-25 23:37:23,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:23,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:37:23,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:23,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:37:23,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:23,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:23,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:23,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:23,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:23,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:23,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:23,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:23,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:23,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:24,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:24,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:24,057 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-25 23:37:24,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:24,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-25 23:37:24,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:24,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-25 23:37:24,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:24,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 11 treesize of output 7 [2022-11-25 23:37:24,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:24,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:24,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:24,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:24,479 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:37:24,617 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:37:26,986 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4045#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= 3 |ULTIMATE.start_sll_circular_update_at_~data#1|) (<= 3 |ULTIMATE.start_sll_circular_update_at_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 3 |ULTIMATE.start_main_~new_data~0#1|) (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= |ULTIMATE.start_main_~new_data~0#1| 3) (<= 1 |ULTIMATE.start_sll_circular_update_at_#in~index#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:37:26,986 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:37:26,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:37:26,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 22 [2022-11-25 23:37:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077774395] [2022-11-25 23:37:26,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:37:26,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 23:37:26,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:26,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 23:37:26,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1284, Unknown=0, NotChecked=0, Total=1406 [2022-11-25 23:37:26,989 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 22 states, 20 states have (on average 2.45) internal successors, (49), 18 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 23:37:27,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:27,625 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-11-25 23:37:27,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:37:27,626 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.45) internal successors, (49), 18 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 33 [2022-11-25 23:37:27,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:27,626 INFO L225 Difference]: With dead ends: 88 [2022-11-25 23:37:27,626 INFO L226 Difference]: Without dead ends: 88 [2022-11-25 23:37:27,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=149, Invalid=1573, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 23:37:27,628 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 147 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:27,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 363 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:37:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-25 23:37:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2022-11-25 23:37:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.56) internal successors, (78), 65 states have internal predecessors, (78), 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-11-25 23:37:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-11-25 23:37:27,631 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 33 [2022-11-25 23:37:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:27,631 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-11-25 23:37:27,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.45) internal successors, (49), 18 states have internal predecessors, (49), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-25 23:37:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-11-25 23:37:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:37:27,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:27,632 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:27,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:27,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 23:37:27,832 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:37:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2055158716, now seen corresponding path program 1 times [2022-11-25 23:37:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:27,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838332720] [2022-11-25 23:37:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:37:27,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:27,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838332720] [2022-11-25 23:37:27,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838332720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:27,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119074841] [2022-11-25 23:37:27,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:27,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:27,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:27,990 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:28,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:37:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:28,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:37:28,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:28,213 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:37:28,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:37:28,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119074841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:37:28,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:37:28,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-25 23:37:28,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466686917] [2022-11-25 23:37:28,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:37:28,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:37:28,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:28,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:37:28,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:37:28,218 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:37:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:28,284 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-11-25 23:37:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:37:28,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-25 23:37:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:28,285 INFO L225 Difference]: With dead ends: 65 [2022-11-25 23:37:28,285 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:37:28,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:37:28,286 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 137 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:28,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 62 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:37:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:37:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 23:37:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 61 states have internal predecessors, (70), 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-11-25 23:37:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-11-25 23:37:28,289 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 33 [2022-11-25 23:37:28,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:28,289 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-11-25 23:37:28,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:37:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-11-25 23:37:28,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:37:28,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:28,290 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:28,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:28,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:28,491 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:37:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:28,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2055162288, now seen corresponding path program 1 times [2022-11-25 23:37:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:28,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360346279] [2022-11-25 23:37:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:29,300 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:29,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:29,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360346279] [2022-11-25 23:37:29,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360346279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:29,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041694041] [2022-11-25 23:37:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:29,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:29,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:29,302 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:29,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 23:37:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:29,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 23:37:29,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:29,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:37:29,579 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:37:29,580 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 11 treesize of output 11 [2022-11-25 23:37:29,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:29,686 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:37:29,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 23:37:29,813 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:37:29,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 23:37:29,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:29,877 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 31 treesize of output 26 [2022-11-25 23:37:29,932 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 25 treesize of output 13 [2022-11-25 23:37:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:37:29,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:37:31,330 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1260 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1260) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-11-25 23:37:31,344 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1260 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1260) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-11-25 23:37:31,354 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1260 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1260) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-11-25 23:37:31,366 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-25 23:37:31,366 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 29 treesize of output 28 [2022-11-25 23:37:31,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:37:31,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 23:37:31,458 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 136 treesize of output 112 [2022-11-25 23:37:31,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 98 [2022-11-25 23:37:31,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-11-25 23:37:31,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041694041] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:31,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [797620122] [2022-11-25 23:37:31,591 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-25 23:37:31,591 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:37:31,591 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:37:31,592 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:37:31,592 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:37:31,612 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-11-25 23:37:31,617 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-11-25 23:37:31,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:31,630 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-11-25 23:37:31,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:31,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:31,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:37:31,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:31,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:37:31,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 13 treesize of output 9 [2022-11-25 23:37:31,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:37:31,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:31,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:37:31,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:37:31,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:31,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:31,974 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:31,976 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:31,978 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:31,980 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:31,983 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:32,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:37:32,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:37:32,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:32,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:32,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:37:32,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:32,166 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:32,167 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:32,169 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:32,170 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:32,172 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:32,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:32,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:32,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:32,257 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 23 treesize of output 11 [2022-11-25 23:37:32,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:32,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:32,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:32,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:32,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:32,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:37:32,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:37:32,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:37:32,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:37:32,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:37:32,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:37:32,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:37:33,030 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:37:33,165 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:37:36,616 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4654#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (not (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:37:36,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:37:36,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:37:36,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 29 [2022-11-25 23:37:36,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214390539] [2022-11-25 23:37:36,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:37:36,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 23:37:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:37:36,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 23:37:36,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2554, Unknown=17, NotChecked=312, Total=3080 [2022-11-25 23:37:36,619 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 30 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:37:37,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:37:37,543 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-11-25 23:37:37,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:37:37,544 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-11-25 23:37:37,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:37:37,544 INFO L225 Difference]: With dead ends: 112 [2022-11-25 23:37:37,544 INFO L226 Difference]: Without dead ends: 112 [2022-11-25 23:37:37,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=318, Invalid=3583, Unknown=17, NotChecked=372, Total=4290 [2022-11-25 23:37:37,547 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 342 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:37:37,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 386 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:37:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-25 23:37:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 64. [2022-11-25 23:37:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 60 states have internal predecessors, (68), 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-11-25 23:37:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-11-25 23:37:37,550 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 33 [2022-11-25 23:37:37,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:37:37,551 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-11-25 23:37:37,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:37:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-11-25 23:37:37,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:37:37,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:37:37,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:37:37,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 23:37:37,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:37,758 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:37:37,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:37:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2055162289, now seen corresponding path program 1 times [2022-11-25 23:37:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:37:37,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096332622] [2022-11-25 23:37:37,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:37:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:37:39,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:37:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096332622] [2022-11-25 23:37:39,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096332622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041671022] [2022-11-25 23:37:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:37:39,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:37:39,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:37:39,150 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:37:39,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 23:37:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:37:39,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-25 23:37:39,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:37:39,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:37:39,680 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:37:39,681 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 11 treesize of output 11 [2022-11-25 23:37:39,688 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 14 treesize of output 16 [2022-11-25 23:37:39,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:39,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:39,888 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:37:39,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-25 23:37:39,893 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 33 treesize of output 33 [2022-11-25 23:37:40,123 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:37:40,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-11-25 23:37:40,130 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 33 treesize of output 33 [2022-11-25 23:37:40,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,229 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 37 treesize of output 32 [2022-11-25 23:37:40,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:40,237 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 36 treesize of output 31 [2022-11-25 23:37:40,320 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 31 treesize of output 19 [2022-11-25 23:37:40,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2022-11-25 23:37:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:37:40,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:37:40,908 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1375) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1376 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-25 23:37:41,272 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1375 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1373))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1374) .cse0 v_ArrVal_1376) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1375) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1374 (Array Int Int)) (v_ArrVal_1373 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1374) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1373) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1376) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) is different from false [2022-11-25 23:37:41,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:37:41,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-11-25 23:37:41,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:37:41,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-25 23:37:41,305 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 54 treesize of output 46 [2022-11-25 23:37:41,310 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 146 treesize of output 134 [2022-11-25 23:37:41,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2022-11-25 23:37:41,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-11-25 23:37:41,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-11-25 23:37:41,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:37:41,381 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-11-25 23:37:41,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:37:41,392 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-11-25 23:37:41,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:41,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 74 treesize of output 50 [2022-11-25 23:37:41,401 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:41,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:41,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 42 treesize of output 30 [2022-11-25 23:37:53,693 WARN L233 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 31 DAG size of output: 28 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:37:53,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041671022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:37:53,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1462907320] [2022-11-25 23:37:53,696 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-25 23:37:53,697 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:37:53,697 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:37:53,697 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:37:53,697 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:37:53,723 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-11-25 23:37:53,727 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-11-25 23:37:53,735 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-11-25 23:37:53,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:37:53,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-11-25 23:37:53,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:53,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:37:53,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:53,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:37:53,772 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 13 treesize of output 9 [2022-11-25 23:37:53,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:53,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:53,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:53,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:53,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:53,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:53,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:53,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:53,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:53,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:53,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:54,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:37:54,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:54,018 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 23 treesize of output 11 [2022-11-25 23:37:54,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:37:54,231 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,233 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,235 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,237 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:54,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:54,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:54,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:54,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:54,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:37:54,491 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,493 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,495 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,496 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:54,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:54,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:54,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:54,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:54,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:54,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:54,634 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-25 23:37:54,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:54,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-25 23:37:54,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:54,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-25 23:37:54,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:37:54,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:54,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:54,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:54,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:54,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:54,937 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,939 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,940 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,943 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:54,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:37:55,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:55,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:55,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:37:55,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:55,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:37:55,195 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:55,197 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:55,199 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:55,201 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:37:55,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:37:55,399 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:37:55,399 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:37:55,431 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:37:55,431 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:37:55,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:37:55,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 23:37:55,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:55,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:55,893 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-25 23:37:55,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 389 [2022-11-25 23:37:55,937 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:37:55,937 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 405 treesize of output 404 [2022-11-25 23:37:55,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:55,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:37:56,008 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-25 23:37:56,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 403 treesize of output 381 [2022-11-25 23:37:56,353 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:37:56,353 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 158 treesize of output 152 [2022-11-25 23:37:56,394 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:37:56,395 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 154 treesize of output 148 [2022-11-25 23:37:56,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:37:56,906 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-25 23:37:57,130 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:38:06,644 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5071#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (not (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|))) (not (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) 1) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ 4 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= (+ |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (= |#NULL.base| 0))' at error location [2022-11-25 23:38:06,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:38:06,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:38:06,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2022-11-25 23:38:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381293182] [2022-11-25 23:38:06,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:38:06,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 23:38:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 23:38:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=3902, Unknown=33, NotChecked=254, Total=4422 [2022-11-25 23:38:06,647 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 36 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:38:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:08,233 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2022-11-25 23:38:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 23:38:08,234 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-11-25 23:38:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:08,234 INFO L225 Difference]: With dead ends: 92 [2022-11-25 23:38:08,234 INFO L226 Difference]: Without dead ends: 92 [2022-11-25 23:38:08,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=360, Invalid=5017, Unknown=33, NotChecked=290, Total=5700 [2022-11-25 23:38:08,238 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 523 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:08,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 893 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:38:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-25 23:38:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 61. [2022-11-25 23:38:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.391304347826087) internal successors, (64), 57 states have internal predecessors, (64), 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-11-25 23:38:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2022-11-25 23:38:08,241 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 33 [2022-11-25 23:38:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:08,241 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2022-11-25 23:38:08,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:38:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2022-11-25 23:38:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:38:08,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:08,242 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:08,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:08,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:08,446 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:38:08,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2058590045, now seen corresponding path program 1 times [2022-11-25 23:38:08,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:08,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307819214] [2022-11-25 23:38:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:08,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 23:38:08,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:08,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307819214] [2022-11-25 23:38:08,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307819214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:38:08,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152255545] [2022-11-25 23:38:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:08,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:08,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:08,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:38:08,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 23:38:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:08,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:38:08,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:38:08,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:38:08,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152255545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:08,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:38:08,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2022-11-25 23:38:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020700163] [2022-11-25 23:38:08,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:08,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:38:08,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:38:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:38:08,837 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:38:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:08,919 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-11-25 23:38:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:38:08,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-11-25 23:38:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:08,921 INFO L225 Difference]: With dead ends: 63 [2022-11-25 23:38:08,921 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 23:38:08,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:38:08,921 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 54 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:08,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 107 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:38:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 23:38:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-11-25 23:38:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 57 states have internal predecessors, (63), 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-11-25 23:38:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-11-25 23:38:08,924 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 33 [2022-11-25 23:38:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:08,924 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-11-25 23:38:08,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:38:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-11-25 23:38:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 23:38:08,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:08,925 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:08,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:09,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 23:38:09,138 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:38:09,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash -673905859, now seen corresponding path program 1 times [2022-11-25 23:38:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:09,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511890245] [2022-11-25 23:38:09,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:38:11,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:11,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511890245] [2022-11-25 23:38:11,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511890245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:38:11,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971982432] [2022-11-25 23:38:11,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:11,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:11,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:11,187 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:38:11,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 23:38:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:11,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-25 23:38:11,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:11,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:38:11,729 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:38:11,730 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 11 treesize of output 11 [2022-11-25 23:38:11,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:11,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:11,903 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:38:11,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-25 23:38:11,909 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 10 treesize of output 9 [2022-11-25 23:38:12,136 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:38:12,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-11-25 23:38:12,141 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 29 treesize of output 21 [2022-11-25 23:38:12,145 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 32 treesize of output 34 [2022-11-25 23:38:12,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:12,336 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 43 treesize of output 38 [2022-11-25 23:38:12,343 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 28 treesize of output 30 [2022-11-25 23:38:12,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:12,349 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 35 treesize of output 34 [2022-11-25 23:38:12,520 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 33 treesize of output 21 [2022-11-25 23:38:12,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 13 [2022-11-25 23:38:12,592 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 19 treesize of output 7 [2022-11-25 23:38:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:38:12,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:38:12,934 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_1606 Int) (v_ArrVal_1605 (Array Int Int)) (v_ArrVal_1603 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1605) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_1606)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse2 .cse1 v_ArrVal_1603)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1) .cse3)) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1605 (Array Int Int)) (v_ArrVal_1603 Int)) (<= .cse3 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1605) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_1606)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse2 .cse1 v_ArrVal_1603)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1))))) is different from false [2022-11-25 23:38:13,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:13,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-25 23:38:13,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:13,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-25 23:38:13,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-25 23:38:13,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:13,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-25 23:38:13,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:13,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-25 23:38:13,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-25 23:38:13,505 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1603 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1600) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1603) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)))) (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1601 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1601) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1606) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1601 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1601) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1606) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-25 23:38:13,940 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1601 (Array Int Int))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1601) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1606) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (forall ((v_ArrVal_1606 Int) (v_ArrVal_1601 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1601) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1606) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1603 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1600) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1603) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-11-25 23:38:13,973 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1597 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1601 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1597))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1601)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1606) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1598 (Array Int Int)) (v_ArrVal_1597 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_1600 (Array Int Int)) (v_ArrVal_1603 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1598))) (= (select (store (select (store .cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1597) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1600) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1603) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1597 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1601 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1597))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse2 (select (store (select (store .cse3 .cse2 v_ArrVal_1601) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_64| 4) v_ArrVal_1606) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) is different from false [2022-11-25 23:38:14,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:38:14,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2022-11-25 23:38:14,020 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 161 treesize of output 149 [2022-11-25 23:38:14,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:14,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 132 [2022-11-25 23:38:14,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:14,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 105 [2022-11-25 23:38:14,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:14,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 90 [2022-11-25 23:38:14,051 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:38:14,052 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 1 [2022-11-25 23:38:14,058 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:38:14,058 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 1 [2022-11-25 23:38:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-25 23:38:14,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971982432] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:38:14,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [873243254] [2022-11-25 23:38:14,544 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:38:14,544 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:38:14,544 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:38:14,545 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:38:14,545 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:38:14,562 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-11-25 23:38:14,565 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-11-25 23:38:14,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:14,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:14,581 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-11-25 23:38:14,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:14,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:38:14,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:14,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:38:14,602 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 13 treesize of output 9 [2022-11-25 23:38:14,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:14,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:14,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:14,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:14,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:14,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:14,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:14,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:14,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:14,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:14,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:38:14,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:38:14,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:14,871 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 23 treesize of output 11 [2022-11-25 23:38:14,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:38:15,104 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,106 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,108 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,109 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:15,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:15,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:38:15,322 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,324 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,326 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,327 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,329 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:15,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:15,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:38:15,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:38:15,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:15,438 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 23 treesize of output 11 [2022-11-25 23:38:15,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:38:15,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:15,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:15,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,697 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,698 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,700 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,702 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:38:15,823 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,824 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,826 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,827 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,829 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:15,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:15,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:15,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:15,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2022-11-25 23:38:16,088 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:38:16,088 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:38:16,111 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:38:16,111 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 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 23:38:16,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:16,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 23:38:16,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:16,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:16,564 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-25 23:38:16,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 389 [2022-11-25 23:38:16,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:16,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:16,633 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-25 23:38:16,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 389 [2022-11-25 23:38:16,670 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-25 23:38:16,671 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 405 treesize of output 404 [2022-11-25 23:38:17,020 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:38:17,020 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 160 treesize of output 154 [2022-11-25 23:38:17,056 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:38:17,056 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 156 treesize of output 150 [2022-11-25 23:38:17,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:38:17,478 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-25 23:38:17,670 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:38:28,401 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5758#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) 1) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ 4 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|)) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= (+ |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (= |#NULL.base| 0))' at error location [2022-11-25 23:38:28,401 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:38:28,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:38:28,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 60 [2022-11-25 23:38:28,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112680348] [2022-11-25 23:38:28,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:38:28,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-25 23:38:28,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:28,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-25 23:38:28,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=5525, Unknown=46, NotChecked=612, Total=6480 [2022-11-25 23:38:28,404 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 60 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 51 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 23:38:37,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:37,652 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-11-25 23:38:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 23:38:37,652 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 51 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2022-11-25 23:38:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:37,653 INFO L225 Difference]: With dead ends: 82 [2022-11-25 23:38:37,653 INFO L226 Difference]: Without dead ends: 82 [2022-11-25 23:38:37,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2191 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=551, Invalid=8731, Unknown=46, NotChecked=772, Total=10100 [2022-11-25 23:38:37,657 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 337 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:37,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 675 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1283 Invalid, 0 Unknown, 255 Unchecked, 1.7s Time] [2022-11-25 23:38:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-25 23:38:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 61. [2022-11-25 23:38:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 57 states have internal predecessors, (62), 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-11-25 23:38:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-11-25 23:38:37,660 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 35 [2022-11-25 23:38:37,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:37,661 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-11-25 23:38:37,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 51 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 23:38:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-11-25 23:38:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 23:38:37,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:37,662 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:37,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:37,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 23:38:37,866 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:38:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1720175675, now seen corresponding path program 1 times [2022-11-25 23:38:37,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:37,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526283217] [2022-11-25 23:38:37,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:38:38,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:38,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526283217] [2022-11-25 23:38:38,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526283217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:38:38,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807431580] [2022-11-25 23:38:38,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:38,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:38,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:38,803 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:38:38,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 23:38:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:39,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-25 23:38:39,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:39,171 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 17 treesize of output 13 [2022-11-25 23:38:39,367 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 19 treesize of output 7 [2022-11-25 23:38:39,397 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:38:39,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:38:39,636 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 38 treesize of output 32 [2022-11-25 23:38:39,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:39,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:38:39,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807431580] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:38:39,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [353265963] [2022-11-25 23:38:39,804 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:38:39,804 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:38:39,804 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:38:39,804 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:38:39,805 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:38:39,824 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-11-25 23:38:39,829 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-11-25 23:38:39,835 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-11-25 23:38:39,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:39,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:39,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:39,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:38:39,867 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 13 treesize of output 9 [2022-11-25 23:38:39,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:39,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:38:39,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:38:40,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:38:40,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:40,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:40,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:38:40,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:40,164 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:40,165 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:40,167 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:40,168 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:40,171 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:40,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:38:40,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:40,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:38:40,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:40,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:38:40,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:40,385 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:40,386 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:40,388 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:40,390 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:40,391 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:40,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:40,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:40,480 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-25 23:38:40,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:40,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-25 23:38:40,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:40,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 222 [2022-11-25 23:38:40,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:40,594 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 23 treesize of output 11 [2022-11-25 23:38:40,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:38:40,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:38:40,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:40,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:40,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:38:40,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:38:40,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:40,982 INFO L321 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-25 23:38:40,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 235 [2022-11-25 23:38:41,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:41,056 INFO L321 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-25 23:38:41,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 215 [2022-11-25 23:38:41,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:38:41,597 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:38:41,597 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 146 treesize of output 140 [2022-11-25 23:38:41,636 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:38:41,636 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 142 treesize of output 136 [2022-11-25 23:38:42,333 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:38:42,505 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:38:47,765 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6223#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) (= |#NULL.base| 0))' at error location [2022-11-25 23:38:47,765 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:38:47,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:38:47,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 32 [2022-11-25 23:38:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32702394] [2022-11-25 23:38:47,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:38:47,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-25 23:38:47,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-25 23:38:47,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=2534, Unknown=1, NotChecked=0, Total=2756 [2022-11-25 23:38:47,767 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:38:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:48,912 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2022-11-25 23:38:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 23:38:48,912 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-11-25 23:38:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:48,913 INFO L225 Difference]: With dead ends: 89 [2022-11-25 23:38:48,913 INFO L226 Difference]: Without dead ends: 89 [2022-11-25 23:38:48,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=369, Invalid=3536, Unknown=1, NotChecked=0, Total=3906 [2022-11-25 23:38:48,915 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 620 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:48,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 555 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:38:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-25 23:38:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2022-11-25 23:38:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 59 states have internal predecessors, (64), 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-11-25 23:38:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-11-25 23:38:48,919 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 39 [2022-11-25 23:38:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:48,919 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-11-25 23:38:48,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 31 states have internal predecessors, (87), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:38:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-11-25 23:38:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:38:48,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:48,920 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:48,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:49,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:49,127 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:38:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1474569637, now seen corresponding path program 2 times [2022-11-25 23:38:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:49,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485243509] [2022-11-25 23:38:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:38:49,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:49,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485243509] [2022-11-25 23:38:49,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485243509] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:38:49,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706055371] [2022-11-25 23:38:49,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:38:49,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:49,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:49,279 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:38:49,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 23:38:49,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:38:49,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:38:49,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:38:49,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 23:38:49,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:38:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-25 23:38:49,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706055371] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:38:49,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1449765893] [2022-11-25 23:38:49,667 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:38:49,667 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:38:49,667 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:38:49,667 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:38:49,667 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:38:49,685 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-11-25 23:38:49,690 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-11-25 23:38:49,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:49,702 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-11-25 23:38:49,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:49,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:49,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:38:49,725 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 13 treesize of output 9 [2022-11-25 23:38:49,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:49,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:38:49,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:38:49,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:49,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:49,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:49,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:49,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:50,009 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:50,011 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:50,013 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:50,016 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:50,018 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:50,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:38:50,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:50,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:50,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:50,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:50,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:50,224 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:50,226 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:50,228 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:50,230 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:50,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:50,265 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 23 treesize of output 11 [2022-11-25 23:38:50,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:38:50,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:38:50,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:50,423 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 124 treesize of output 108 [2022-11-25 23:38:50,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:50,434 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 0 case distinctions, treesize of input 120 treesize of output 108 [2022-11-25 23:38:50,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:50,445 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 0 case distinctions, treesize of input 116 treesize of output 104 [2022-11-25 23:38:50,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:50,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:50,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:38:50,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:38:50,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:38:50,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:38:50,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:38:50,981 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:38:50,981 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 146 treesize of output 140 [2022-11-25 23:38:51,022 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:38:51,022 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 142 treesize of output 136 [2022-11-25 23:38:51,679 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:38:51,802 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:38:56,081 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6663#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)) (= |#NULL.base| 0))' at error location [2022-11-25 23:38:56,081 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:38:56,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:38:56,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-25 23:38:56,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121029456] [2022-11-25 23:38:56,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:38:56,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:38:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:56,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:38:56,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-11-25 23:38:56,083 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:38:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:56,228 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-11-25 23:38:56,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:38:56,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-25 23:38:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:56,229 INFO L225 Difference]: With dead ends: 57 [2022-11-25 23:38:56,229 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 23:38:56,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:38:56,230 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 118 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:56,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 86 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:38:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 23:38:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-25 23:38:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 53 states have internal predecessors, (57), 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-11-25 23:38:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-11-25 23:38:56,235 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 41 [2022-11-25 23:38:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:56,235 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-11-25 23:38:56,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:38:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-11-25 23:38:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:38:56,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:56,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:56,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 23:38:56,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-25 23:38:56,442 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:38:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:56,443 INFO L85 PathProgramCache]: Analyzing trace with hash 476045988, now seen corresponding path program 1 times [2022-11-25 23:38:56,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:56,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888708948] [2022-11-25 23:38:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:56,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:38:56,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:56,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888708948] [2022-11-25 23:38:56,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888708948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:56,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:56,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:38:56,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722069552] [2022-11-25 23:38:56,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:56,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:38:56,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:56,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:38:56,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:38:56,550 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:38:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:56,665 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2022-11-25 23:38:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:38:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-25 23:38:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:56,666 INFO L225 Difference]: With dead ends: 74 [2022-11-25 23:38:56,666 INFO L226 Difference]: Without dead ends: 74 [2022-11-25 23:38:56,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:38:56,667 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 94 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:56,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:38:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-25 23:38:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2022-11-25 23:38:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 56 states have internal predecessors, (63), 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-11-25 23:38:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-11-25 23:38:56,669 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 41 [2022-11-25 23:38:56,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:56,670 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-11-25 23:38:56,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:38:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-11-25 23:38:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:38:56,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:56,670 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:56,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 23:38:56,670 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:38:56,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:56,671 INFO L85 PathProgramCache]: Analyzing trace with hash 476045989, now seen corresponding path program 1 times [2022-11-25 23:38:56,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:56,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403283238] [2022-11-25 23:38:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:38:56,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:56,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403283238] [2022-11-25 23:38:56,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403283238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:56,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:56,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:38:56,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970763312] [2022-11-25 23:38:56,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:56,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:38:56,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:56,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:38:56,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:38:56,994 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:38:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:57,199 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-11-25 23:38:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:38:57,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-25 23:38:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:57,200 INFO L225 Difference]: With dead ends: 58 [2022-11-25 23:38:57,200 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 23:38:57,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:38:57,200 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 115 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:57,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 82 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:38:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 23:38:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-25 23:38:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 54 states have internal predecessors, (60), 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-11-25 23:38:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-25 23:38:57,203 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 41 [2022-11-25 23:38:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:57,204 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-25 23:38:57,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:38:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-25 23:38:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 23:38:57,205 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:57,205 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:57,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 23:38:57,205 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:38:57,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1872557616, now seen corresponding path program 1 times [2022-11-25 23:38:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:57,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470282242] [2022-11-25 23:38:57,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:57,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:38:57,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:57,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470282242] [2022-11-25 23:38:57,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470282242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:38:57,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:38:57,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 23:38:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413679818] [2022-11-25 23:38:57,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:38:57,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:38:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:38:57,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:38:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:38:57,362 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:38:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:38:57,502 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-11-25 23:38:57,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:38:57,503 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-11-25 23:38:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:38:57,503 INFO L225 Difference]: With dead ends: 58 [2022-11-25 23:38:57,503 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 23:38:57,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:38:57,504 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 112 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:38:57,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 105 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:38:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 23:38:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-25 23:38:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 54 states have internal predecessors, (59), 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-11-25 23:38:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-11-25 23:38:57,507 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 42 [2022-11-25 23:38:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:38:57,508 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-11-25 23:38:57,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:38:57,508 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-11-25 23:38:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 23:38:57,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:38:57,509 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:38:57,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 23:38:57,509 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:38:57,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:38:57,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2081232209, now seen corresponding path program 1 times [2022-11-25 23:38:57,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:38:57,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170371854] [2022-11-25 23:38:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:57,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:38:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 23:38:57,726 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:38:57,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170371854] [2022-11-25 23:38:57,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170371854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:38:57,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522577114] [2022-11-25 23:38:57,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:38:57,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:38:57,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:38:57,732 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:38:57,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 23:38:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:38:57,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 23:38:57,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:38:58,260 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 17 treesize of output 9 [2022-11-25 23:38:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:38:58,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:38:58,367 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-25 23:38:58,367 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 16 treesize of output 15 [2022-11-25 23:38:58,408 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-25 23:38:58,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:38:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 23:38:58,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522577114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:38:58,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1898895574] [2022-11-25 23:38:58,471 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-25 23:38:58,471 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:38:58,471 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:38:58,471 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:38:58,472 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:38:58,490 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-11-25 23:38:58,493 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-11-25 23:38:58,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:58,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:58,509 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-11-25 23:38:58,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:58,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:38:58,523 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 13 treesize of output 9 [2022-11-25 23:38:58,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:58,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:38:58,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:38:58,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:38:58,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:58,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:58,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:38:58,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:58,778 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:58,779 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:58,781 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:58,783 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:58,784 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:58,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 166 [2022-11-25 23:38:58,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:58,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:58,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:58,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:38:58,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:38:58,966 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:58,973 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:58,975 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:58,976 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-25 23:38:59,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:59,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:59,044 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-25 23:38:59,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:59,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-25 23:38:59,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:59,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-25 23:38:59,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:59,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:38:59,215 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 114 [2022-11-25 23:38:59,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:59,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-11-25 23:38:59,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:59,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 108 [2022-11-25 23:38:59,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:59,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:38:59,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:38:59,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:59,601 INFO L321 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2022-11-25 23:38:59,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 235 [2022-11-25 23:38:59,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:38:59,671 INFO L321 Elim1Store]: treesize reduction 56, result has 38.5 percent of original size [2022-11-25 23:38:59,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 215 [2022-11-25 23:38:59,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:39:00,110 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:39:00,110 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 146 treesize of output 140 [2022-11-25 23:39:00,147 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-25 23:39:00,148 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 142 treesize of output 136 [2022-11-25 23:39:00,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:39:00,813 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:39:00,944 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:08,254 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7489#(and (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 1)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) (not (< 0 (+ |ULTIMATE.start_main_~i~0#1| 1))) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 (+ |ULTIMATE.start_main_~expected~0#1| 2147483648)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 1) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 8) (select |#length| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|)) (<= (+ |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~head#1.base|)) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4)))' at error location [2022-11-25 23:39:08,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:08,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:39:08,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 6] total 20 [2022-11-25 23:39:08,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635412085] [2022-11-25 23:39:08,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:08,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-25 23:39:08,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-25 23:39:08,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1855, Unknown=0, NotChecked=0, Total=2070 [2022-11-25 23:39:08,257 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 21 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 23:39:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:08,895 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2022-11-25 23:39:08,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:39:08,895 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-11-25 23:39:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:08,896 INFO L225 Difference]: With dead ends: 65 [2022-11-25 23:39:08,896 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 23:39:08,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=330, Invalid=2750, Unknown=0, NotChecked=0, Total=3080 [2022-11-25 23:39:08,897 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 193 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:08,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 206 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:39:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 23:39:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2022-11-25 23:39:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 48 states have (on average 1.25) internal successors, (60), 54 states have internal predecessors, (60), 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-11-25 23:39:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-25 23:39:08,900 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 43 [2022-11-25 23:39:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:08,901 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-25 23:39:08,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 23:39:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-25 23:39:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 23:39:08,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:08,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:08,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:09,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-25 23:39:09,108 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:39:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2081232208, now seen corresponding path program 1 times [2022-11-25 23:39:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:09,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987438229] [2022-11-25 23:39:09,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:09,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:39:10,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:10,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987438229] [2022-11-25 23:39:10,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987438229] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:10,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945336228] [2022-11-25 23:39:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:10,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:10,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:10,370 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:10,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 23:39:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:10,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-25 23:39:10,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:10,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:39:10,770 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:39:10,770 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 11 treesize of output 11 [2022-11-25 23:39:10,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:10,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:10,937 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:39:10,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-25 23:39:10,941 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 18 treesize of output 20 [2022-11-25 23:39:11,064 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-11-25 23:39:11,122 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-11-25 23:39:11,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:11,236 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-11-25 23:39:11,565 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 23 treesize of output 15 [2022-11-25 23:39:11,569 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 26 treesize of output 14 [2022-11-25 23:39:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 23:39:11,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:11,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:11,863 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 32 treesize of output 36 [2022-11-25 23:39:11,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:11,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2022-11-25 23:39:12,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:12,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-25 23:39:12,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:12,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-25 23:39:12,624 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 50 treesize of output 42 [2022-11-25 23:39:12,632 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 258 treesize of output 238 [2022-11-25 23:39:12,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 218 [2022-11-25 23:39:12,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 210 [2022-11-25 23:39:12,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2022-11-25 23:39:13,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945336228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:13,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [537372174] [2022-11-25 23:39:13,020 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-25 23:39:13,020 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:39:13,020 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:39:13,020 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:39:13,020 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:13,037 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-11-25 23:39:13,042 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-11-25 23:39:13,049 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-11-25 23:39:13,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:13,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:13,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:13,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:39:13,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:13,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:39:13,085 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 13 treesize of output 9 [2022-11-25 23:39:13,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:39:13,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:39:13,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:13,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:13,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:13,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:39:13,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:13,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:39:13,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:13,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:13,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:13,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:13,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-25 23:39:13,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:13,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-25 23:39:13,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:13,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-25 23:39:13,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:39:13,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:13,566 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 23 treesize of output 11 [2022-11-25 23:39:13,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:39:13,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:39:13,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:13,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:13,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:13,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:13,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:39:13,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:39:13,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:13,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:14,568 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:39:14,696 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:22,550 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7923#(and (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 1) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= (+ |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|)))) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:39:22,550 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:22,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:39:22,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 38 [2022-11-25 23:39:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202414384] [2022-11-25 23:39:22,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:22,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 23:39:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 23:39:22,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=5655, Unknown=9, NotChecked=0, Total=6006 [2022-11-25 23:39:22,552 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 39 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:39:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:24,287 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-25 23:39:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:39:24,288 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2022-11-25 23:39:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:24,288 INFO L225 Difference]: With dead ends: 66 [2022-11-25 23:39:24,288 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 23:39:24,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=604, Invalid=7759, Unknown=9, NotChecked=0, Total=8372 [2022-11-25 23:39:24,290 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 407 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:24,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 158 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:39:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 23:39:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2022-11-25 23:39:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 55 states have internal predecessors, (60), 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-11-25 23:39:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-11-25 23:39:24,293 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 43 [2022-11-25 23:39:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:24,293 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-11-25 23:39:24,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:39:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-11-25 23:39:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-25 23:39:24,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:24,295 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:24,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-25 23:39:24,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:24,500 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:39:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash -93623152, now seen corresponding path program 1 times [2022-11-25 23:39:24,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:24,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242937519] [2022-11-25 23:39:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:24,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 23:39:24,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:24,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242937519] [2022-11-25 23:39:24,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242937519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:39:24,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:39:24,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 23:39:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411890739] [2022-11-25 23:39:24,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:39:24,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 23:39:24,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:24,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 23:39:24,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:39:24,694 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:39:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:24,908 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-25 23:39:24,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 23:39:24,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-11-25 23:39:24,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:24,909 INFO L225 Difference]: With dead ends: 58 [2022-11-25 23:39:24,909 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 23:39:24,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:39:24,910 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 100 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:24,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 76 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:39:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 23:39:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-25 23:39:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.183673469387755) internal successors, (58), 54 states have internal predecessors, (58), 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-11-25 23:39:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-11-25 23:39:24,912 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 44 [2022-11-25 23:39:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:24,913 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-11-25 23:39:24,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:39:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-11-25 23:39:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 23:39:24,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:24,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:24,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 23:39:24,914 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:39:24,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1390660131, now seen corresponding path program 1 times [2022-11-25 23:39:24,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:24,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305765016] [2022-11-25 23:39:24,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:26,229 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:39:26,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:26,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305765016] [2022-11-25 23:39:26,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305765016] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:26,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148657471] [2022-11-25 23:39:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:26,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:26,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:26,230 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:26,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 23:39:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:26,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-25 23:39:26,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:26,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:39:26,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 23:39:26,727 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:39:26,727 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 11 treesize of output 11 [2022-11-25 23:39:26,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:26,925 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:39:26,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-25 23:39:27,133 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:39:27,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-25 23:39:27,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:27,229 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 29 treesize of output 24 [2022-11-25 23:39:27,383 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 23 treesize of output 11 [2022-11-25 23:39:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 23:39:27,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:27,867 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2353 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2353) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-25 23:39:27,878 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2353 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2353) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-25 23:39:27,887 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (<= (+ 1 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2352))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2353)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_#StackHeapBarrier|)) is different from false [2022-11-25 23:39:27,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:27,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-25 23:39:27,905 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 252 treesize of output 216 [2022-11-25 23:39:27,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-11-25 23:39:27,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 188 [2022-11-25 23:39:28,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148657471] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:28,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1768836170] [2022-11-25 23:39:28,212 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2022-11-25 23:39:28,212 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:39:28,212 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:39:28,213 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:39:28,213 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:28,234 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-11-25 23:39:28,238 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-11-25 23:39:28,244 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-11-25 23:39:28,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:28,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:28,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:28,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:39:28,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 13 treesize of output 9 [2022-11-25 23:39:28,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:28,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:39:28,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:28,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:28,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:39:28,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:39:28,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:28,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:28,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:28,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:39:28,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:28,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:39:28,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:28,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:28,555 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-25 23:39:28,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:28,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-25 23:39:28,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:28,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-25 23:39:28,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:39:28,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:28,717 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 25 treesize of output 13 [2022-11-25 23:39:28,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:39:28,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:28,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:28,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:39:28,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:28,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:39:28,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:29,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:29,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:39:29,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:29,774 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:39:29,914 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:39,033 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8504#(and (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset|) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |ULTIMATE.start_sll_circular_destroy_~q~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 1) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|)) (not (< |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |#StackHeapBarrier|)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (+ |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (not (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |ULTIMATE.start_sll_circular_destroy_~q~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:39:39,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:39,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:39:39,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2022-11-25 23:39:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874648292] [2022-11-25 23:39:39,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:39,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 23:39:39,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:39,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 23:39:39,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=4378, Unknown=17, NotChecked=408, Total=5112 [2022-11-25 23:39:39,035 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 36 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:39:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:41,560 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-11-25 23:39:41,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:39:41,561 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2022-11-25 23:39:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:41,562 INFO L225 Difference]: With dead ends: 63 [2022-11-25 23:39:41,562 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 23:39:41,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=543, Invalid=6761, Unknown=18, NotChecked=510, Total=7832 [2022-11-25 23:39:41,563 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 281 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:41,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 171 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:39:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 23:39:41,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2022-11-25 23:39:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.18) internal successors, (59), 55 states have internal predecessors, (59), 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-11-25 23:39:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-11-25 23:39:41,566 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 45 [2022-11-25 23:39:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:41,567 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-11-25 23:39:41,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 2.2903225806451615) internal successors, (71), 31 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:39:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-11-25 23:39:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 23:39:41,567 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:41,568 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:41,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-25 23:39:41,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-25 23:39:41,768 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:39:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:41,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1693378177, now seen corresponding path program 1 times [2022-11-25 23:39:41,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:41,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117102289] [2022-11-25 23:39:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:39:42,574 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:42,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117102289] [2022-11-25 23:39:42,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117102289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:42,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348456194] [2022-11-25 23:39:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:42,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:42,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:42,575 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:42,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 23:39:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:42,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-25 23:39:42,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:42,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:39:42,872 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:39:42,872 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 11 treesize of output 11 [2022-11-25 23:39:42,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:42,938 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:39:42,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-25 23:39:43,059 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:39:43,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-25 23:39:43,118 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 20 treesize of output 19 [2022-11-25 23:39:43,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:43,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2022-11-25 23:39:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:39:43,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:43,695 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2466 (Array Int Int)) (v_ArrVal_2468 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2466) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_2468) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-11-25 23:39:43,703 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2466 (Array Int Int)) (v_ArrVal_2465 (Array Int Int)) (v_ArrVal_2468 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2465))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2466)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_2468) 0)))) is different from false [2022-11-25 23:39:43,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:43,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2022-11-25 23:39:43,717 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 161 treesize of output 149 [2022-11-25 23:39:43,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:43,729 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 155 treesize of output 154 [2022-11-25 23:39:43,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:43,742 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 165 treesize of output 161 [2022-11-25 23:39:43,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 170 [2022-11-25 23:39:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 3 not checked. [2022-11-25 23:39:44,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348456194] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:39:44,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [981111090] [2022-11-25 23:39:44,382 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2022-11-25 23:39:44,383 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:39:44,383 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:39:44,383 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:39:44,383 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:39:44,405 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-11-25 23:39:44,409 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-11-25 23:39:44,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:44,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:44,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 15 treesize of output 1 [2022-11-25 23:39:44,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:44,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:39:44,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:44,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 23:39:44,449 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 13 treesize of output 9 [2022-11-25 23:39:44,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:44,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:44,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:39:44,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:39:44,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:39:44,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2022-11-25 23:39:44,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 23:39:44,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:44,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-11-25 23:39:44,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 3 [2022-11-25 23:39:44,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:44,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:44,756 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-11-25 23:39:44,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:44,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 206 [2022-11-25 23:39:44,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:39:44,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 214 [2022-11-25 23:39:44,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:44,919 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 23 treesize of output 11 [2022-11-25 23:39:44,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:39:44,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 23:39:45,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-25 23:39:45,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:45,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:45,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:45,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:39:45,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:45,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:39:45,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:45,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 23:39:45,861 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-11-25 23:39:45,990 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-25 23:39:46,111 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:39:54,374 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9006#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.base|) (not (= |ULTIMATE.start_sll_circular_destroy_~head#1.base| 0)) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (< |ULTIMATE.start_sll_circular_destroy_~head#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (<= (+ |ULTIMATE.start_sll_circular_destroy_~head#1.offset| 4) (select |#length| |ULTIMATE.start_sll_circular_destroy_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |#NULL.offset| 0) (= |ULTIMATE.start_sll_circular_destroy_#in~head#1.base| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) |ULTIMATE.start_sll_circular_destroy_~head#1.offset|) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= (select |#valid| |ULTIMATE.start_sll_circular_destroy_~head#1.base|) 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-11-25 23:39:54,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:39:54,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:39:54,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 43 [2022-11-25 23:39:54,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769788399] [2022-11-25 23:39:54,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:39:54,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-25 23:39:54,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:39:54,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-25 23:39:54,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=4369, Unknown=23, NotChecked=270, Total=4970 [2022-11-25 23:39:54,376 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 43 states, 39 states have (on average 2.282051282051282) internal successors, (89), 37 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:39:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:39:55,758 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-11-25 23:39:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:39:55,759 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 2.282051282051282) internal successors, (89), 37 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2022-11-25 23:39:55,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:39:55,759 INFO L225 Difference]: With dead ends: 57 [2022-11-25 23:39:55,759 INFO L226 Difference]: Without dead ends: 57 [2022-11-25 23:39:55,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1809 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=466, Invalid=6161, Unknown=23, NotChecked=322, Total=6972 [2022-11-25 23:39:55,761 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 274 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:39:55,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 215 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 715 Invalid, 0 Unknown, 91 Unchecked, 0.6s Time] [2022-11-25 23:39:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-25 23:39:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-11-25 23:39:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 52 states have internal predecessors, (55), 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-11-25 23:39:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-11-25 23:39:55,763 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 47 [2022-11-25 23:39:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:39:55,764 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-11-25 23:39:55,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 2.282051282051282) internal successors, (89), 37 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 23:39:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-11-25 23:39:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 23:39:55,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:39:55,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:39:55,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 23:39:55,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-25 23:39:55,970 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:39:55,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:39:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash -98416032, now seen corresponding path program 1 times [2022-11-25 23:39:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:39:55,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639344493] [2022-11-25 23:39:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:55,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:39:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:39:57,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:39:57,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639344493] [2022-11-25 23:39:57,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639344493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:39:57,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708156690] [2022-11-25 23:39:57,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:39:57,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:39:57,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:39:57,490 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:39:57,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-25 23:39:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:39:57,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-25 23:39:57,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:39:57,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:39:57,893 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:39:57,893 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 11 treesize of output 11 [2022-11-25 23:39:57,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:58,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:39:58,081 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:39:58,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-11-25 23:39:58,087 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 27 treesize of output 22 [2022-11-25 23:39:58,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:58,350 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:39:58,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 57 [2022-11-25 23:39:58,367 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-11-25 23:39:58,367 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-11-25 23:39:58,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:39:58,529 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 23:39:58,530 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 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-25 23:39:58,536 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 25 treesize of output 25 [2022-11-25 23:39:58,896 INFO L321 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-11-25 23:39:58,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2022-11-25 23:39:58,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:39:58,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-25 23:39:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:39:59,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:39:59,634 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_destroy_~head#1.base|) |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (and (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select .cse0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset|))) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.base| (select .cse1 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)))) (or (= .cse2 |c_ULTIMATE.start_sll_circular_destroy_~head#1.base|) (and (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select .cse0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset|))) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.base| (select .cse1 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0))))))))) is different from false [2022-11-25 23:40:00,503 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_2589 Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_2589)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2590 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2590) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))))) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_2589)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int) (v_ArrVal_2590 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2590) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_2589)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (forall ((v_ArrVal_2589 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_2589)))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select .cse5 .cse4) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)))))))))) is different from false [2022-11-25 23:40:00,645 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int)) (or (forall ((v_ArrVal_2589 Int)) (let ((.cse1 (store .cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2589 Int)) (let ((.cse3 (select (store .cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2590 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2590) .cse3) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)))) (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int)) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= (select (let ((.cse4 (store .cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int)) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int) (v_ArrVal_2590 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2590) (select (store .cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-25 23:40:13,194 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:41:00,524 WARN L233 SmtUtils]: Spent 10.27s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:41:00,846 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse3 (select |c_#memory_$Pointer$.base| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4) v_ArrVal_2587)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))) (not (<= .cse4 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (not (<= .cse4 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)) (forall ((v_ArrVal_2588 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (forall ((v_ArrVal_2589 Int)) (let ((.cse6 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4))) (let ((.cse7 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 .cse6 v_ArrVal_2587)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store .cse5 .cse6 v_ArrVal_2588)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2590) .cse7) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)))) (= .cse7 |c_ULTIMATE.start_main_~s~0#1.base|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (forall ((v_ArrVal_2588 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int) (v_ArrVal_2590 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse8 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store .cse5 .cse8 v_ArrVal_2588)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2590) (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 .cse8 v_ArrVal_2587)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))) (not (<= .cse4 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (forall ((v_ArrVal_2589 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4) v_ArrVal_2587)))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse9 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store .cse10 |c_ULTIMATE.start_main_~s~0#1.base| .cse11) .cse9) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0))))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= .cse4 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|))))))) is different from false [2022-11-25 23:41:01,054 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse8 (select .cse7 .cse3)) (.cse4 (select .cse2 .cse3)) (.cse5 (select (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse0 (store .cse2 .cse3 (store .cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4) v_ArrVal_2587)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))) (not (<= .cse5 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (not (<= .cse5 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)) (forall ((v_ArrVal_2588 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (forall ((v_ArrVal_2589 Int)) (let ((.cse9 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4))) (let ((.cse6 (select (store (select (store .cse2 .cse3 (store .cse4 .cse9 v_ArrVal_2587)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2590 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store (store .cse7 .cse3 (store .cse8 .cse9 v_ArrVal_2588)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2590) .cse6) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (forall ((v_ArrVal_2588 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_2589 Int) (v_ArrVal_2590 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= (select (let ((.cse10 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4))) (select (store (store .cse7 .cse3 (store .cse8 .cse10 v_ArrVal_2588)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2590) (select (store (select (store .cse2 .cse3 (store .cse4 .cse10 v_ArrVal_2587)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (not (<= .cse5 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| Int)) (or (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| Int) (v_ArrVal_2587 Int)) (or (forall ((v_ArrVal_2589 Int)) (let ((.cse11 (store .cse2 .cse3 (store .cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126| 4) v_ArrVal_2587)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| 4) v_ArrVal_2589))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse12) .cse13) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse13)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_125| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (not (<= .cse5 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_126|)))))))) is different from false [2022-11-25 23:41:04,307 INFO L321 Elim1Store]: treesize reduction 288, result has 49.9 percent of original size [2022-11-25 23:41:04,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 1641 treesize of output 1846 [2022-11-25 23:41:22,443 WARN L233 SmtUtils]: Spent 18.08s on a formula simplification. DAG size of input: 536 DAG size of output: 319 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 23:41:22,444 INFO L321 Elim1Store]: treesize reduction 1691, result has 37.3 percent of original size [2022-11-25 23:41:22,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 13 new quantified variables, introduced 40 case distinctions, treesize of input 399257 treesize of output 139861 [2022-11-25 23:42:24,128 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 2022295 column 7: canceled [2022-11-25 23:42:24,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1731420988] [2022-11-25 23:42:24,130 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-25 23:42:24,130 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:24,130 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:24,130 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:24,130 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:26,138 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 2022297 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:273) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:221) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:42:26,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:42:26,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2022-11-25 23:42:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596688272] [2022-11-25 23:42:26,140 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:26,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 23:42:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:26,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 23:42:26,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1913, Unknown=34, NotChecked=460, Total=2550 [2022-11-25 23:42:26,142 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 23 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 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-11-25 23:42:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:42:28,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 61.5s TimeCoverageRelationStatistics Valid=143, Invalid=1913, Unknown=34, NotChecked=460, Total=2550 [2022-11-25 23:42:28,200 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:28,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:28,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:28,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-25 23:42:28,401 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 2022299 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.push(ManagedScript.java:124) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:366) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:42:28,404 INFO L158 Benchmark]: Toolchain (without parser) took 359165.50ms. Allocated memory was 188.7MB in the beginning and 14.5GB in the end (delta: 14.3GB). Free memory was 143.3MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-11-25 23:42:28,404 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:42:28,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.87ms. Allocated memory is still 188.7MB. Free memory was 142.8MB in the beginning and 125.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:42:28,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.11ms. Allocated memory is still 188.7MB. Free memory was 125.5MB in the beginning and 122.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:42:28,404 INFO L158 Benchmark]: Boogie Preprocessor took 33.19ms. Allocated memory is still 188.7MB. Free memory was 122.9MB in the beginning and 121.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:42:28,405 INFO L158 Benchmark]: RCFGBuilder took 805.76ms. Allocated memory is still 188.7MB. Free memory was 121.3MB in the beginning and 153.6MB in the end (delta: -32.3MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2022-11-25 23:42:28,405 INFO L158 Benchmark]: TraceAbstraction took 357780.08ms. Allocated memory was 188.7MB in the beginning and 14.5GB in the end (delta: 14.3GB). Free memory was 152.6MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-11-25 23:42:28,406 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.87ms. Allocated memory is still 188.7MB. Free memory was 142.8MB in the beginning and 125.5MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.11ms. Allocated memory is still 188.7MB. Free memory was 125.5MB in the beginning and 122.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.19ms. Allocated memory is still 188.7MB. Free memory was 122.9MB in the beginning and 121.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 805.76ms. Allocated memory is still 188.7MB. Free memory was 121.3MB in the beginning and 153.6MB in the end (delta: -32.3MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * TraceAbstraction took 357780.08ms. Allocated memory was 188.7MB in the beginning and 14.5GB in the end (delta: 14.3GB). Free memory was 152.6MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 2022299 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 2022299 column 7: canceled: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-25 23:42:28,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- 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-38b53e6 [2022-11-25 23:42:31,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:42:31,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:42:31,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:42:31,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:42:31,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:42:31,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:42:31,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:42:31,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:42:31,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:42:31,315 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:42:31,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:42:31,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:42:31,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:42:31,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:42:31,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:42:31,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:42:31,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:42:31,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:42:31,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:42:31,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:42:31,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:42:31,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:42:31,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:42:31,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:42:31,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:42:31,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:42:31,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:42:31,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:42:31,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:42:31,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:42:31,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:42:31,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:42:31,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:42:31,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:42:31,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:42:31,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:42:31,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:42:31,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:42:31,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:42:31,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:42:31,388 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-25 23:42:31,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:42:31,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:42:31,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:42:31,433 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:42:31,434 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:42:31,435 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:42:31,435 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:42:31,435 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:42:31,435 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:42:31,436 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:42:31,437 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:42:31,437 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:42:31,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:42:31,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:42:31,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:42:31,439 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:42:31,439 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:42:31,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:42:31,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:42:31,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:42:31,440 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:42:31,440 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:42:31,440 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:42:31,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:42:31,441 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:42:31,441 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 23:42:31,441 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 23:42:31,441 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:42:31,442 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:42:31,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:42:31,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 23:42:31,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:42:31,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:42:31,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:42:31,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:42:31,444 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 23:42:31,444 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 23:42:31,444 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:42:31,444 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 23:42:31,445 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/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_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-11-25 23:42:31,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:42:31,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:42:31,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:42:31,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:42:31,864 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:42:31,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-25 23:42:35,205 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:42:35,504 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:42:35,512 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-25 23:42:35,524 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/data/f0901ff00/4d7d06237de3415980951e088f3e10ea/FLAGc71da695f [2022-11-25 23:42:35,538 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/data/f0901ff00/4d7d06237de3415980951e088f3e10ea [2022-11-25 23:42:35,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:42:35,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:42:35,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:42:35,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:42:35,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:42:35,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:42:35" (1/1) ... [2022-11-25 23:42:35,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75255ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:35, skipping insertion in model container [2022-11-25 23:42:35,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:42:35" (1/1) ... [2022-11-25 23:42:35,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:42:35,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:42:35,901 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_04f6a1a2-4f7f-4843-b67c-7946717d4200/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-25 23:42:35,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:42:35,931 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:42:36,013 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_04f6a1a2-4f7f-4843-b67c-7946717d4200/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-25 23:42:36,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:42:36,061 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:42:36,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36 WrapperNode [2022-11-25 23:42:36,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:42:36,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:42:36,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:42:36,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:42:36,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,130 INFO L138 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-11-25 23:42:36,131 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:42:36,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:42:36,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:42:36,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:42:36,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,162 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:42:36,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:42:36,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:42:36,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:42:36,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (1/1) ... [2022-11-25 23:42:36,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:42:36,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:36,220 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:42:36,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:42:36,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 23:42:36,270 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-25 23:42:36,270 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-25 23:42:36,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:42:36,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:42:36,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 23:42:36,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 23:42:36,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:42:36,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 23:42:36,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 23:42:36,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:42:36,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:42:36,416 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:42:36,420 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:42:36,981 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:42:37,019 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:42:37,020 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-25 23:42:37,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:42:37 BoogieIcfgContainer [2022-11-25 23:42:37,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:42:37,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:42:37,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:42:37,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:42:37,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:42:35" (1/3) ... [2022-11-25 23:42:37,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5b14bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:42:37, skipping insertion in model container [2022-11-25 23:42:37,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:36" (2/3) ... [2022-11-25 23:42:37,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5b14bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:42:37, skipping insertion in model container [2022-11-25 23:42:37,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:42:37" (3/3) ... [2022-11-25 23:42:37,038 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-11-25 23:42:37,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:42:37,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-25 23:42:37,123 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:42:37,131 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;@236b0992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:42:37,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-11-25 23:42:37,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 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-11-25 23:42:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:42:37,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:37,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:42:37,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:37,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-11-25 23:42:37,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:37,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194511726] [2022-11-25 23:42:37,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:37,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:37,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:37,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:37,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 23:42:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:37,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 23:42:37,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:37,392 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 7 [2022-11-25 23:42:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:37,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:42:37,427 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:37,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194511726] [2022-11-25 23:42:37,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194511726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:37,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:37,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:42:37,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497269986] [2022-11-25 23:42:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:37,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:42:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:37,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:42:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:37,492 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-25 23:42:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:37,651 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-11-25 23:42:37,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:42:37,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-11-25 23:42:37,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:37,662 INFO L225 Difference]: With dead ends: 81 [2022-11-25 23:42:37,662 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 23:42:37,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:37,670 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:37,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:37,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 23:42:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-25 23:42:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 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-11-25 23:42:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-11-25 23:42:37,751 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-11-25 23:42:37,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:37,752 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-11-25 23:42:37,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-25 23:42:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-11-25 23:42:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:42:37,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:37,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:42:37,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:37,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:37,965 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:37,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:37,966 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-11-25 23:42:37,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:37,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612353761] [2022-11-25 23:42:37,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:37,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:37,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:37,969 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:37,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 23:42:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:38,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:42:38,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:38,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:42:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:38,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:42:38,085 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:38,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612353761] [2022-11-25 23:42:38,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612353761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:38,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:38,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:42:38,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713239514] [2022-11-25 23:42:38,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:38,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:42:38,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:38,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:42:38,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:38,089 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-25 23:42:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:38,212 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-25 23:42:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:42:38,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-11-25 23:42:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:38,214 INFO L225 Difference]: With dead ends: 76 [2022-11-25 23:42:38,215 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 23:42:38,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:38,216 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:38,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 23:42:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-25 23:42:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 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-11-25 23:42:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-11-25 23:42:38,225 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-11-25 23:42:38,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:38,225 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-11-25 23:42:38,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-11-25 23:42:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-11-25 23:42:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:42:38,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:38,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:38,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-25 23:42:38,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:38,438 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-11-25 23:42:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:38,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727353502] [2022-11-25 23:42:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:38,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:38,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:38,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:38,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 23:42:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:38,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:42:38,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:38,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:42:38,592 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:38,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727353502] [2022-11-25 23:42:38,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727353502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:38,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:38,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:42:38,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96431646] [2022-11-25 23:42:38,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:38,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:42:38,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:38,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:42:38,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:38,595 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-11-25 23:42:38,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:38,610 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-11-25 23:42:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:42:38,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-11-25 23:42:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:38,612 INFO L225 Difference]: With dead ends: 83 [2022-11-25 23:42:38,613 INFO L226 Difference]: Without dead ends: 83 [2022-11-25 23:42:38,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:38,614 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:38,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-25 23:42:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-11-25 23:42:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 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-11-25 23:42:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-11-25 23:42:38,624 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-11-25 23:42:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:38,624 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-11-25 23:42:38,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-11-25 23:42:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-11-25 23:42:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:42:38,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:38,626 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:38,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:38,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:38,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:38,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-11-25 23:42:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:38,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752581151] [2022-11-25 23:42:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:38,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:38,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:38,841 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:38,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 23:42:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:39,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:42:39,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:39,025 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 7 [2022-11-25 23:42:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:42:39,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:42:39,104 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:39,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752581151] [2022-11-25 23:42:39,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752581151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:39,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:39,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:42:39,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196601235] [2022-11-25 23:42:39,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:39,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:42:39,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:39,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:42:39,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:42:39,108 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:39,473 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-11-25 23:42:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:42:39,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-25 23:42:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:39,476 INFO L225 Difference]: With dead ends: 97 [2022-11-25 23:42:39,477 INFO L226 Difference]: Without dead ends: 97 [2022-11-25 23:42:39,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:42:39,478 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:39,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 227 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:42:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-25 23:42:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-11-25 23:42:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 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-11-25 23:42:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-11-25 23:42:39,498 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-11-25 23:42:39,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:39,499 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-11-25 23:42:39,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-11-25 23:42:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:42:39,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:39,504 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:39,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:39,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:39,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:39,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:39,717 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-11-25 23:42:39,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:39,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791147307] [2022-11-25 23:42:39,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:39,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:39,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:39,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:39,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 23:42:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:39,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:42:39,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:39,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:42:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:42:40,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:42:40,028 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:40,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791147307] [2022-11-25 23:42:40,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791147307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:40,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:40,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:42:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117391512] [2022-11-25 23:42:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:40,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:42:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:42:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:42:40,043 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:40,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:40,376 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-25 23:42:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:42:40,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-25 23:42:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:40,378 INFO L225 Difference]: With dead ends: 76 [2022-11-25 23:42:40,379 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 23:42:40,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:42:40,380 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:40,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 236 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:42:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 23:42:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-11-25 23:42:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 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-11-25 23:42:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-11-25 23:42:40,393 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-11-25 23:42:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:40,393 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-11-25 23:42:40,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-11-25 23:42:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:42:40,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:40,394 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:40,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:40,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:40,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:40,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:40,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-11-25 23:42:40,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:40,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130383415] [2022-11-25 23:42:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:40,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:40,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:40,598 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:40,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 23:42:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:40,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 23:42:40,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:40,754 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 7 [2022-11-25 23:42:40,838 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_114 (_ BitVec 1))) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_114) |c_#valid|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-25 23:42:40,936 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:42:40,937 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 19 treesize of output 27 [2022-11-25 23:42:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-25 23:42:40,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:41,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:42:41,235 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:41,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130383415] [2022-11-25 23:42:41,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130383415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:41,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1569293216] [2022-11-25 23:42:41,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:41,236 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:42:41,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:42:41,242 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:42:41,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-25 23:42:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:41,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 23:42:41,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:41,475 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 7 [2022-11-25 23:42:41,571 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 23:42:41,572 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 14 treesize of output 20 [2022-11-25 23:42:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:42:41,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:42:41,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1569293216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:41,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:42:41,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 6] total 11 [2022-11-25 23:42:41,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023509978] [2022-11-25 23:42:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:41,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:42:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:41,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:42:41,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2022-11-25 23:42:41,657 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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-11-25 23:42:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:42,052 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-11-25 23:42:42,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:42:42,053 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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) Word has length 25 [2022-11-25 23:42:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:42,054 INFO L225 Difference]: With dead ends: 94 [2022-11-25 23:42:42,054 INFO L226 Difference]: Without dead ends: 94 [2022-11-25 23:42:42,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=101, Unknown=1, NotChecked=20, Total=156 [2022-11-25 23:42:42,055 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 64 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:42,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 304 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:42:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-25 23:42:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2022-11-25 23:42:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 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-11-25 23:42:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-11-25 23:42:42,061 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2022-11-25 23:42:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:42,062 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-11-25 23:42:42,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 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-11-25 23:42:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-11-25 23:42:42,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:42:42,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:42,063 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:42,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:42,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-25 23:42:42,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:42,464 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:42,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-11-25 23:42:42,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:42,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496263199] [2022-11-25 23:42:42,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:42,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:42,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:42,467 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:42,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 23:42:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:42,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 23:42:42,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:42,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:42:42,730 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 7 [2022-11-25 23:42:42,961 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_191) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-25 23:42:43,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,054 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-11-25 23:42:43,069 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:42:43,069 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 13 treesize of output 13 [2022-11-25 23:42:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 23:42:43,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:43,461 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:43,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496263199] [2022-11-25 23:42:43,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496263199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:43,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [278583416] [2022-11-25 23:42:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:43,462 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:42:43,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:42:43,466 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:42:43,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-25 23:42:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:43,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 23:42:43,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:43,732 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 7 [2022-11-25 23:42:43,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:42:43,867 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_231 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_231))) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-25 23:42:43,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:43,943 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-11-25 23:42:43,958 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:42:43,958 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 13 treesize of output 13 [2022-11-25 23:42:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 23:42:43,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:44,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [278583416] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:44,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371344386] [2022-11-25 23:42:44,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:44,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:44,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:44,195 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:44,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:42:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:44,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 23:42:44,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:44,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:42:44,485 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_270 (_ BitVec 32))) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_270) |c_#length|)) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-25 23:42:44,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:44,556 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-11-25 23:42:44,571 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:42:44,572 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 13 treesize of output 13 [2022-11-25 23:42:44,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-25 23:42:44,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:44,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371344386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:44,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:42:44,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2022-11-25 23:42:44,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801519296] [2022-11-25 23:42:44,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:44,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:42:44,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:44,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:42:44,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=89, Unknown=3, NotChecked=60, Total=182 [2022-11-25 23:42:44,803 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:42:45,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:45,676 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2022-11-25 23:42:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:42:45,678 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-25 23:42:45,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:45,679 INFO L225 Difference]: With dead ends: 156 [2022-11-25 23:42:45,679 INFO L226 Difference]: Without dead ends: 156 [2022-11-25 23:42:45,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=125, Unknown=3, NotChecked=72, Total=240 [2022-11-25 23:42:45,680 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 83 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:45,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 358 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 278 Invalid, 0 Unknown, 495 Unchecked, 0.6s Time] [2022-11-25 23:42:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-25 23:42:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 80. [2022-11-25 23:42:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.509090909090909) internal successors, (83), 75 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:42:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-11-25 23:42:45,688 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 25 [2022-11-25 23:42:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:45,688 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-11-25 23:42:45,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:42:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-11-25 23:42:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 23:42:45,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:45,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:45,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:45,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:46,106 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:46,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:42:46,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-11-25 23:42:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:46,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260825756] [2022-11-25 23:42:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:46,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:46,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:46,307 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:46,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 23:42:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:46,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:42:46,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:42:46,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:42:46,518 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:46,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260825756] [2022-11-25 23:42:46,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260825756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:46,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:46,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:42:46,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471747048] [2022-11-25 23:42:46,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:46,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:42:46,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:46,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:42:46,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:42:46,520 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:46,587 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-11-25 23:42:46,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:42:46,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-25 23:42:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:46,590 INFO L225 Difference]: With dead ends: 111 [2022-11-25 23:42:46,590 INFO L226 Difference]: Without dead ends: 111 [2022-11-25 23:42:46,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:42:46,592 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 128 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:46,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 223 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-25 23:42:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2022-11-25 23:42:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 78 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:42:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2022-11-25 23:42:46,606 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 30 [2022-11-25 23:42:46,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:46,607 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2022-11-25 23:42:46,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2022-11-25 23:42:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 23:42:46,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:46,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:46,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:46,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:46,822 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:46,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:46,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2022-11-25 23:42:46,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:46,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719608648] [2022-11-25 23:42:46,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:46,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:46,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:46,824 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:46,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 23:42:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:46,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 23:42:46,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:47,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:42:47,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:42:47,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:42:47,214 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:47,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719608648] [2022-11-25 23:42:47,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719608648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:47,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:47,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 23:42:47,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109439636] [2022-11-25 23:42:47,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:47,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:42:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:47,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:42:47,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:42:47,216 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:48,049 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2022-11-25 23:42:48,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:42:48,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-25 23:42:48,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:48,051 INFO L225 Difference]: With dead ends: 135 [2022-11-25 23:42:48,051 INFO L226 Difference]: Without dead ends: 135 [2022-11-25 23:42:48,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:42:48,052 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 315 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:48,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 430 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 23:42:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-25 23:42:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 86. [2022-11-25 23:42:48,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 81 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:42:48,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2022-11-25 23:42:48,056 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 30 [2022-11-25 23:42:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:48,057 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2022-11-25 23:42:48,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:48,057 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2022-11-25 23:42:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 23:42:48,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:48,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:48,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:48,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:48,258 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:48,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:48,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866880, now seen corresponding path program 1 times [2022-11-25 23:42:48,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:48,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774100626] [2022-11-25 23:42:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:48,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:48,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:48,261 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:48,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 23:42:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:48,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 23:42:48,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:48,436 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 7 [2022-11-25 23:42:48,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:42:48,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:42:48,554 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:48,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774100626] [2022-11-25 23:42:48,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774100626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:48,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:48,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 23:42:48,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926972128] [2022-11-25 23:42:48,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:48,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:42:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:48,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:42:48,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:42:48,556 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:49,219 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-11-25 23:42:49,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:42:49,220 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-25 23:42:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:49,221 INFO L225 Difference]: With dead ends: 106 [2022-11-25 23:42:49,221 INFO L226 Difference]: Without dead ends: 106 [2022-11-25 23:42:49,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:42:49,222 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 294 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:49,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 293 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 23:42:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-25 23:42:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2022-11-25 23:42:49,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 81 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:42:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-11-25 23:42:49,226 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 30 [2022-11-25 23:42:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:49,227 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-11-25 23:42:49,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:42:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-11-25 23:42:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:42:49,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:49,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:49,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:49,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:49,438 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:42:49,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-11-25 23:42:49,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:42:49,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286908247] [2022-11-25 23:42:49,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:49,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:42:49,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:42:49,440 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:42:49,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 23:42:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:49,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-25 23:42:49,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:49,631 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 7 [2022-11-25 23:42:49,790 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:42:49,790 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 13 treesize of output 13 [2022-11-25 23:42:49,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:42:49,968 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:42:49,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-25 23:42:50,171 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 27 treesize of output 15 [2022-11-25 23:42:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:50,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:50,468 INFO L321 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2022-11-25 23:42:50,469 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 23 treesize of output 22 [2022-11-25 23:42:50,477 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-25 23:42:50,686 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:42:50,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286908247] [2022-11-25 23:42:50,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286908247] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:50,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [186471754] [2022-11-25 23:42:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:50,687 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:42:50,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:42:50,688 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:42:50,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-11-25 23:42:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:50,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 23:42:50,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:50,998 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 7 [2022-11-25 23:42:51,224 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:42:51,225 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 19 treesize of output 27 [2022-11-25 23:42:51,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:42:51,650 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:42:51,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-25 23:42:52,027 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 27 treesize of output 15 [2022-11-25 23:42:52,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:52,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:52,275 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_484) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (_ bv0 1))) is different from false [2022-11-25 23:42:52,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:52,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-25 23:42:52,418 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 38 treesize of output 30 [2022-11-25 23:42:52,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-25 23:42:59,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [186471754] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:59,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820332109] [2022-11-25 23:42:59,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:59,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:59,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:59,066 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:59,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 23:42:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:59,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 23:42:59,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:59,282 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:42:59,285 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 13 treesize of output 13 [2022-11-25 23:42:59,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:42:59,344 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:42:59,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-25 23:42:59,392 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 27 treesize of output 15 [2022-11-25 23:42:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:59,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:59,456 INFO L321 Elim1Store]: treesize reduction 7, result has 58.8 percent of original size [2022-11-25 23:42:59,456 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 23 treesize of output 22 [2022-11-25 23:42:59,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820332109] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:59,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:42:59,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 30 [2022-11-25 23:42:59,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592094118] [2022-11-25 23:42:59,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:59,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 23:42:59,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:42:59,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 23:42:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1443, Unknown=4, NotChecked=154, Total=1722 [2022-11-25 23:42:59,647 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 31 states, 30 states have (on average 1.7) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:43:02,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:02,584 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2022-11-25 23:43:02,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:43:02,584 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-11-25 23:43:02,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:02,585 INFO L225 Difference]: With dead ends: 172 [2022-11-25 23:43:02,586 INFO L226 Difference]: Without dead ends: 172 [2022-11-25 23:43:02,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=268, Invalid=1992, Unknown=4, NotChecked=186, Total=2450 [2022-11-25 23:43:02,587 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 236 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:02,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1059 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-25 23:43:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-25 23:43:02,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 95. [2022-11-25 23:43:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.457142857142857) internal successors, (102), 90 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:43:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-11-25 23:43:02,593 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 33 [2022-11-25 23:43:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:02,593 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-11-25 23:43:02,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 27 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:43:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-11-25 23:43:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 23:43:02,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:02,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:02,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:02,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:03,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:03,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:03,202 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:43:03,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:03,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2022-11-25 23:43:03,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:43:03,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247756419] [2022-11-25 23:43:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:03,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:03,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:43:03,205 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:43:03,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-25 23:43:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:03,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 23:43:03,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:03,429 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 7 [2022-11-25 23:43:03,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:43:03,722 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:43:03,722 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 13 treesize of output 13 [2022-11-25 23:43:03,730 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-11-25 23:43:03,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:43:03,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:43:04,011 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:43:04,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-25 23:43:04,019 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 18 treesize of output 20 [2022-11-25 23:43:04,279 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-11-25 23:43:04,284 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 25 treesize of output 13 [2022-11-25 23:43:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:04,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:05,388 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_576) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2022-11-25 23:43:05,444 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_576) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_577 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_577) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2022-11-25 23:43:05,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:05,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-11-25 23:43:05,486 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 44 treesize of output 32 [2022-11-25 23:43:05,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:05,519 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-25 23:43:05,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:05,539 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-25 23:43:05,546 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:05,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 19 [2022-11-25 23:43:05,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:05,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 12 [2022-11-25 23:43:08,248 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:43:08,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247756419] [2022-11-25 23:43:08,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247756419] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:08,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2094033114] [2022-11-25 23:43:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:08,249 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:08,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:43:08,254 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:43:08,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-11-25 23:43:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:08,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-25 23:43:08,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:08,636 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 7 [2022-11-25 23:43:08,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:43:09,039 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:43:09,039 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-11-25 23:43:09,065 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:43:09,066 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 13 treesize of output 13 [2022-11-25 23:43:09,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:43:09,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:43:09,598 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:43:09,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-25 23:43:09,607 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 18 treesize of output 20 [2022-11-25 23:43:10,073 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-11-25 23:43:10,076 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 25 treesize of output 13 [2022-11-25 23:43:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:10,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:10,212 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-25 23:43:10,260 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_629 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_629) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_628 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-25 23:43:10,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:10,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-25 23:43:10,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:10,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-25 23:43:10,290 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 52 treesize of output 44 [2022-11-25 23:43:10,293 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 82 treesize of output 70 [2022-11-25 23:43:10,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-11-25 23:43:10,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-25 23:43:10,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:10,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-11-25 23:43:10,451 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 44 treesize of output 32 [2022-11-25 23:43:10,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:43:11,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2094033114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:11,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061634127] [2022-11-25 23:43:11,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:11,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:11,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:11,027 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:11,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 23:43:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:11,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 23:43:11,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:11,207 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 7 [2022-11-25 23:43:11,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:43:11,381 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:43:11,382 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-11-25 23:43:11,406 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:43:11,406 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 13 treesize of output 13 [2022-11-25 23:43:11,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:43:11,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:43:11,497 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:43:11,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-25 23:43:11,504 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 18 treesize of output 20 [2022-11-25 23:43:11,565 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-11-25 23:43:11,568 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 25 treesize of output 13 [2022-11-25 23:43:11,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:11,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:11,732 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-25 23:43:11,798 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_681 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_681) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-25 23:43:11,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:11,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-11-25 23:43:11,819 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 44 treesize of output 32 [2022-11-25 23:43:11,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:11,848 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-25 23:43:11,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:11,865 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-25 23:43:11,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 27 treesize of output 19 [2022-11-25 23:43:11,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:11,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 12 [2022-11-25 23:43:12,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061634127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:12,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:12,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2022-11-25 23:43:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128344672] [2022-11-25 23:43:12,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:12,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 23:43:12,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:43:12,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 23:43:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1309, Unknown=6, NotChecked=462, Total=1892 [2022-11-25 23:43:12,210 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:43:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:16,372 INFO L93 Difference]: Finished difference Result 206 states and 229 transitions. [2022-11-25 23:43:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:43:16,373 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2022-11-25 23:43:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:16,374 INFO L225 Difference]: With dead ends: 206 [2022-11-25 23:43:16,374 INFO L226 Difference]: Without dead ends: 206 [2022-11-25 23:43:16,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=240, Invalid=1940, Unknown=6, NotChecked=570, Total=2756 [2022-11-25 23:43:16,376 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 910 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 22 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:16,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 1548 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1082 Invalid, 25 Unknown, 0 Unchecked, 2.9s Time] [2022-11-25 23:43:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-25 23:43:16,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 103. [2022-11-25 23:43:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:43:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2022-11-25 23:43:16,382 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 33 [2022-11-25 23:43:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:16,382 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2022-11-25 23:43:16,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 25 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 23:43:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2022-11-25 23:43:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 23:43:16,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:16,384 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:16,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:16,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:16,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:16,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:16,988 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:43:16,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2022-11-25 23:43:16,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:43:16,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985977853] [2022-11-25 23:43:16,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:43:16,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:16,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:43:16,990 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:43:16,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-25 23:43:17,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:43:17,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:17,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:43:17,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:43:17,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:43:17,380 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:43:17,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985977853] [2022-11-25 23:43:17,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985977853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:17,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [931764887] [2022-11-25 23:43:17,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:43:17,381 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:17,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:43:17,382 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:43:17,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-11-25 23:43:17,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:43:17,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:17,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:43:17,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:43:17,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:43:17,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [931764887] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:17,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316873054] [2022-11-25 23:43:17,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:43:17,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:17,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:17,794 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:17,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-25 23:43:18,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:43:18,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:18,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:43:18,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:43:18,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 23:43:18,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316873054] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:18,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:43:18,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2022-11-25 23:43:18,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497916382] [2022-11-25 23:43:18,546 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:18,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:43:18,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:43:18,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:43:18,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:43:18,548 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:43:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:19,697 INFO L93 Difference]: Finished difference Result 468 states and 523 transitions. [2022-11-25 23:43:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 23:43:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 36 [2022-11-25 23:43:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:19,700 INFO L225 Difference]: With dead ends: 468 [2022-11-25 23:43:19,701 INFO L226 Difference]: Without dead ends: 468 [2022-11-25 23:43:19,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2022-11-25 23:43:19,702 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 2474 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2474 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:19,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2474 Valid, 529 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:43:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-25 23:43:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 144. [2022-11-25 23:43:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 139 states have internal predecessors, (171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 23:43:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 177 transitions. [2022-11-25 23:43:19,709 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 177 transitions. Word has length 36 [2022-11-25 23:43:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:19,710 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 177 transitions. [2022-11-25 23:43:19,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:43:19,710 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2022-11-25 23:43:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 23:43:19,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:19,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:19,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:19,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:20,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:20,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:20,323 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:43:20,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:20,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1813078092, now seen corresponding path program 2 times [2022-11-25 23:43:20,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:43:20,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960586062] [2022-11-25 23:43:20,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:43:20,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:20,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:43:20,324 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:43:20,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-25 23:43:20,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:43:20,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:20,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:43:20,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:43:20,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:20,579 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 23:43:20,579 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:43:20,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960586062] [2022-11-25 23:43:20,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960586062] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:20,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1110094111] [2022-11-25 23:43:20,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:43:20,580 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:20,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:43:20,582 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:43:20,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2022-11-25 23:43:20,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:43:20,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:20,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:43:20,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:43:20,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 23:43:20,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1110094111] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:20,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663761929] [2022-11-25 23:43:20,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:43:20,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:20,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:20,945 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:20,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-25 23:43:21,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 23:43:21,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:21,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:43:21,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 23:43:21,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 23:43:21,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663761929] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:21,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:43:21,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2022-11-25 23:43:21,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189349532] [2022-11-25 23:43:21,249 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:21,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:43:21,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:43:21,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:43:21,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:43:21,251 INFO L87 Difference]: Start difference. First operand 144 states and 177 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:43:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:21,266 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2022-11-25 23:43:21,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:43:21,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-25 23:43:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:21,268 INFO L225 Difference]: With dead ends: 112 [2022-11-25 23:43:21,268 INFO L226 Difference]: Without dead ends: 112 [2022-11-25 23:43:21,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:43:21,269 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 186 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:21,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 158 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:43:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-25 23:43:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-25 23:43:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 108 states have internal predecessors, (127), 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-11-25 23:43:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions. [2022-11-25 23:43:21,274 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 37 [2022-11-25 23:43:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:21,274 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 131 transitions. [2022-11-25 23:43:21,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:43:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2022-11-25 23:43:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:43:21,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:21,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:21,284 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:21,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-11-25 23:43:21,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:21,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:21,884 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:43:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2022-11-25 23:43:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:43:21,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252906997] [2022-11-25 23:43:21,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:21,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:21,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:43:21,886 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:43:21,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-25 23:43:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:22,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:43:22,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:22,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:22,234 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:43:22,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252906997] [2022-11-25 23:43:22,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252906997] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:22,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [426084937] [2022-11-25 23:43:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:43:22,235 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:43:22,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-25 23:43:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:22,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:43:22,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:22,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:22,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [426084937] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:22,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193384222] [2022-11-25 23:43:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:22,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:22,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:22,646 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:22,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-25 23:43:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:22,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 23:43:22,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 23:43:22,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:43:22,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193384222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:22,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-11-25 23:43:22,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 5, 5, 5] total 16 [2022-11-25 23:43:22,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697681867] [2022-11-25 23:43:22,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:22,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:43:22,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:43:22,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:43:22,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:43:22,996 INFO L87 Difference]: Start difference. First operand 112 states and 131 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:43:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:23,641 INFO L93 Difference]: Finished difference Result 137 states and 157 transitions. [2022-11-25 23:43:23,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:43:23,641 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-11-25 23:43:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:23,642 INFO L225 Difference]: With dead ends: 137 [2022-11-25 23:43:23,643 INFO L226 Difference]: Without dead ends: 137 [2022-11-25 23:43:23,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:43:23,643 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 286 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:23,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 274 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:43:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-25 23:43:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2022-11-25 23:43:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 111 states have internal predecessors, (133), 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-11-25 23:43:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2022-11-25 23:43:23,648 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 40 [2022-11-25 23:43:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:23,648 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2022-11-25 23:43:23,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:43:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2022-11-25 23:43:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 23:43:23,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:23,649 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:23,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:23,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:24,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:24,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:24,253 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:43:24,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:24,254 INFO L85 PathProgramCache]: Analyzing trace with hash 999795887, now seen corresponding path program 1 times [2022-11-25 23:43:24,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:43:24,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995496603] [2022-11-25 23:43:24,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:24,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:24,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:43:24,255 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:43:24,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-25 23:43:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:24,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:43:24,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:24,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:24,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:24,591 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:43:24,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995496603] [2022-11-25 23:43:24,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995496603] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:24,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [3469411] [2022-11-25 23:43:24,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:24,591 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:24,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:43:24,594 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:43:24,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-11-25 23:43:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:24,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:43:24,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:24,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:25,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [3469411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:25,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357648520] [2022-11-25 23:43:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:25,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:25,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:25,014 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:25,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-25 23:43:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:25,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:43:25,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:25,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:25,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357648520] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:25,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:43:25,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 6] total 10 [2022-11-25 23:43:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067860596] [2022-11-25 23:43:25,437 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:25,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:43:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:43:25,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:43:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:43:25,439 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:43:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:25,584 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-11-25 23:43:25,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 23:43:25,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2022-11-25 23:43:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:25,586 INFO L225 Difference]: With dead ends: 186 [2022-11-25 23:43:25,586 INFO L226 Difference]: Without dead ends: 186 [2022-11-25 23:43:25,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:43:25,587 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 468 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:25,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 317 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:43:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-25 23:43:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 163. [2022-11-25 23:43:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 140 states have (on average 1.5285714285714285) internal successors, (214), 159 states have internal predecessors, (214), 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-11-25 23:43:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 218 transitions. [2022-11-25 23:43:25,592 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 218 transitions. Word has length 40 [2022-11-25 23:43:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:25,593 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 218 transitions. [2022-11-25 23:43:25,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:43:25,593 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 218 transitions. [2022-11-25 23:43:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:43:25,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:25,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:25,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:25,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:26,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:26,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:26,213 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:43:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2022-11-25 23:43:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:43:26,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819213635] [2022-11-25 23:43:26,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:26,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:26,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:43:26,214 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:43:26,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-11-25 23:43:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:26,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:43:26,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:26,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:26,586 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:43:26,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819213635] [2022-11-25 23:43:26,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819213635] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:26,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1205101704] [2022-11-25 23:43:26,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:26,587 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:26,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:43:26,588 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:43:26,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-11-25 23:43:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:26,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:43:26,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:26,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:27,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:27,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1205101704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:27,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889961462] [2022-11-25 23:43:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:27,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:27,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:27,027 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:27,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-25 23:43:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:27,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 23:43:27,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:27,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:27,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-25 23:43:27,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889961462] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:27,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:43:27,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 8] total 16 [2022-11-25 23:43:27,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876879779] [2022-11-25 23:43:27,663 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:27,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 23:43:27,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:43:27,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 23:43:27,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-11-25 23:43:27,665 INFO L87 Difference]: Start difference. First operand 163 states and 218 transitions. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:43:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:27,889 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2022-11-25 23:43:27,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:43:27,891 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-11-25 23:43:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:27,892 INFO L225 Difference]: With dead ends: 132 [2022-11-25 23:43:27,892 INFO L226 Difference]: Without dead ends: 132 [2022-11-25 23:43:27,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2022-11-25 23:43:27,892 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 418 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:27,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 483 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:43:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-25 23:43:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2022-11-25 23:43:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.485981308411215) internal successors, (159), 122 states have internal predecessors, (159), 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-11-25 23:43:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2022-11-25 23:43:27,897 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 41 [2022-11-25 23:43:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:27,897 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2022-11-25 23:43:27,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-25 23:43:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2022-11-25 23:43:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 23:43:27,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:27,899 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:27,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2022-11-25 23:43:28,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:28,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:28,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:28,503 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:43:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:28,504 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 2 times [2022-11-25 23:43:28,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:43:28,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842129833] [2022-11-25 23:43:28,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 23:43:28,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:28,504 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:43:28,505 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:43:28,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-11-25 23:43:28,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 23:43:28,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:43:28,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 23:43:28,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:28,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:43:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 23:43:28,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:43:28,942 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:43:28,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842129833] [2022-11-25 23:43:28,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842129833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:43:28,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:43:28,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 23:43:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758747868] [2022-11-25 23:43:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:43:28,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:43:28,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:43:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:43:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:43:28,944 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:43:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:29,573 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2022-11-25 23:43:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:43:29,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-11-25 23:43:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:29,575 INFO L225 Difference]: With dead ends: 178 [2022-11-25 23:43:29,576 INFO L226 Difference]: Without dead ends: 178 [2022-11-25 23:43:29,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-11-25 23:43:29,576 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 409 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:29,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 259 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:43:29,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-25 23:43:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 126. [2022-11-25 23:43:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.411214953271028) internal successors, (151), 122 states have internal predecessors, (151), 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-11-25 23:43:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 155 transitions. [2022-11-25 23:43:29,581 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 155 transitions. Word has length 45 [2022-11-25 23:43:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:29,581 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 155 transitions. [2022-11-25 23:43:29,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 23:43:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 155 transitions. [2022-11-25 23:43:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 23:43:29,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:29,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:29,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:29,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:29,783 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:43:29,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:29,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2022-11-25 23:43:29,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:43:29,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31130620] [2022-11-25 23:43:29,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:29,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:43:29,784 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:43:29,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-25 23:43:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:29,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:43:29,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:43:30,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:43:30,236 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:43:30,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31130620] [2022-11-25 23:43:30,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31130620] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:30,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1338053962] [2022-11-25 23:43:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:30,236 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:30,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:43:30,238 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:43:30,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-25 23:43:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:30,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:43:30,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:43:30,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:43:30,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1338053962] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:30,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395247317] [2022-11-25 23:43:30,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:30,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:30,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:43:30,830 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:43:30,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-25 23:43:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:31,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 23:43:31,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:43:31,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:31,202 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:43:31,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395247317] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:31,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 23:43:31,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2022-11-25 23:43:31,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455935637] [2022-11-25 23:43:31,203 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:31,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:43:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:43:31,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:43:31,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:43:31,205 INFO L87 Difference]: Start difference. First operand 126 states and 155 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:43:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:43:31,502 INFO L93 Difference]: Finished difference Result 190 states and 209 transitions. [2022-11-25 23:43:31,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:43:31,506 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-11-25 23:43:31,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:43:31,507 INFO L225 Difference]: With dead ends: 190 [2022-11-25 23:43:31,507 INFO L226 Difference]: Without dead ends: 190 [2022-11-25 23:43:31,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-11-25 23:43:31,508 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 307 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:43:31,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 491 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:43:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-25 23:43:31,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 123. [2022-11-25 23:43:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 119 states have internal predecessors, (141), 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-11-25 23:43:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2022-11-25 23:43:31,513 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 48 [2022-11-25 23:43:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:43:31,514 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2022-11-25 23:43:31,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:43:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2022-11-25 23:43:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 23:43:31,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:43:31,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:43:31,528 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:31,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:31,935 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-25 23:43:32,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:43:32,129 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:43:32,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:43:32,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2022-11-25 23:43:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:43:32,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701912070] [2022-11-25 23:43:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:32,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:43:32,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:43:32,131 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:43:32,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-25 23:43:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:32,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-25 23:43:32,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:32,440 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 7 [2022-11-25 23:43:32,562 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:43:32,562 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 13 treesize of output 13 [2022-11-25 23:43:32,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:43:32,743 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:43:32,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-25 23:43:33,123 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:43:33,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-25 23:43:33,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:33,185 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 33 treesize of output 28 [2022-11-25 23:43:33,304 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 27 treesize of output 15 [2022-11-25 23:43:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:43:33,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:35,669 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-25 23:43:35,685 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1646) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 23:43:37,872 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1646) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 23:43:37,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1646) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) is different from false [2022-11-25 23:43:37,899 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1646) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-25 23:43:37,926 INFO L321 Elim1Store]: treesize reduction 7, result has 74.1 percent of original size [2022-11-25 23:43:37,926 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 33 treesize of output 32 [2022-11-25 23:43:37,939 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1645))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1646)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-11-25 23:43:37,961 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1645 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1645))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1646)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-25 23:43:37,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:37,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 23:43:37,980 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 136 treesize of output 112 [2022-11-25 23:43:37,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 98 [2022-11-25 23:43:37,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-11-25 23:43:38,450 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:43:38,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701912070] [2022-11-25 23:43:38,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701912070] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:43:38,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [666473382] [2022-11-25 23:43:38,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:43:38,450 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:43:38,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:43:38,453 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:43:38,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-25 23:43:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:43:38,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-25 23:43:38,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:43:38,960 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 7 [2022-11-25 23:43:39,270 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 23:43:39,270 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 19 treesize of output 27 [2022-11-25 23:43:39,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:43:39,835 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:43:39,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-25 23:43:40,734 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:43:40,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-25 23:43:40,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:40,849 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 33 treesize of output 28 [2022-11-25 23:43:41,072 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 27 treesize of output 15 [2022-11-25 23:43:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:43:41,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:45,878 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1706 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1706) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2022-11-25 23:43:48,089 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1705))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1646)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-25 23:43:48,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1705 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1705))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1646)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (_ bv1 1)))) is different from false [2022-11-25 23:43:48,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:48,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-11-25 23:43:48,155 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 152 treesize of output 128 [2022-11-25 23:43:48,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 114 [2022-11-25 23:43:48,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2022-11-25 23:44:07,819 WARN L233 SmtUtils]: Spent 16.46s on a formula simplification. DAG size of input: 35 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:44:07,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [666473382] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:44:07,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119258552] [2022-11-25 23:44:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:44:07,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:44:07,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:44:07,821 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:44:07,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-25 23:44:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:44:08,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-25 23:44:08,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:44:08,042 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 7 [2022-11-25 23:44:08,359 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:08,360 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 13 treesize of output 13 [2022-11-25 23:44:08,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:44:08,800 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:44:08,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-25 23:44:10,564 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:44:10,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-25 23:44:10,634 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 0 case distinctions, treesize of input 33 treesize of output 28 [2022-11-25 23:44:10,873 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 27 treesize of output 15 [2022-11-25 23:44:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:44:10,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:44:17,558 INFO L321 Elim1Store]: treesize reduction 7, result has 74.1 percent of original size [2022-11-25 23:44:17,558 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 33 treesize of output 32 [2022-11-25 23:44:17,569 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1765))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1646)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-11-25 23:44:17,592 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1646 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1765))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1646)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-25 23:44:17,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:44:17,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2022-11-25 23:44:17,611 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 136 treesize of output 112 [2022-11-25 23:44:17,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 98 [2022-11-25 23:44:17,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-11-25 23:44:17,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119258552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:44:17,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:44:17,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 49 [2022-11-25 23:44:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74883012] [2022-11-25 23:44:17,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:44:17,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 23:44:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 23:44:17,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 23:44:17,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3198, Unknown=27, NotChecked=1500, Total=4970 [2022-11-25 23:44:17,847 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 50 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 45 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:44:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:44:23,543 INFO L93 Difference]: Finished difference Result 196 states and 225 transitions. [2022-11-25 23:44:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:44:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 45 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2022-11-25 23:44:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:44:23,546 INFO L225 Difference]: With dead ends: 196 [2022-11-25 23:44:23,546 INFO L226 Difference]: Without dead ends: 196 [2022-11-25 23:44:23,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 152 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=453, Invalid=4398, Unknown=27, NotChecked=1764, Total=6642 [2022-11-25 23:44:23,547 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 299 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:44:23,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1512 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-25 23:44:23,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-25 23:44:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 131. [2022-11-25 23:44:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3660714285714286) internal successors, (153), 127 states have internal predecessors, (153), 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-11-25 23:44:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2022-11-25 23:44:23,554 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 48 [2022-11-25 23:44:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:44:23,555 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2022-11-25 23:44:23,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 45 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 23:44:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2022-11-25 23:44:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 23:44:23,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:44:23,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:44:23,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-25 23:44:23,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2022-11-25 23:44:23,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-25 23:44:24,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 23:44:24,164 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-25 23:44:24,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:44:24,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2022-11-25 23:44:24,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 23:44:24,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550896115] [2022-11-25 23:44:24,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:44:24,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 23:44:24,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 23:44:24,166 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 23:44:24,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-25 23:44:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:44:24,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-25 23:44:24,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:44:24,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:44:24,512 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 7 [2022-11-25 23:44:24,922 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:44:24,923 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 13 treesize of output 13 [2022-11-25 23:44:24,938 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-11-25 23:44:25,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:44:25,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:44:25,339 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:44:25,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-25 23:44:25,353 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 18 treesize of output 20 [2022-11-25 23:44:26,081 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:44:26,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-25 23:44:26,096 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 18 treesize of output 20 [2022-11-25 23:44:26,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:26,224 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 31 treesize of output 26 [2022-11-25 23:44:26,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:26,241 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-11-25 23:44:26,463 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 25 treesize of output 13 [2022-11-25 23:44:26,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-25 23:44:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:44:26,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:44:28,442 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1831) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-25 23:44:28,490 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1831) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-25 23:44:28,529 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1831) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 23:44:28,590 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1831) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-11-25 23:44:28,630 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1831) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) is different from false [2022-11-25 23:44:28,664 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1831) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-11-25 23:44:28,796 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1829) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1828) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1828))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1829) .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1831) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2022-11-25 23:44:28,882 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1829) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1828) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1828 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1828))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1829) .cse1 v_ArrVal_1830) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1831) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-11-25 23:44:28,914 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:44:28,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-11-25 23:44:28,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:44:28,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-11-25 23:44:28,936 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 334 treesize of output 290 [2022-11-25 23:44:28,947 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 1114 treesize of output 1062 [2022-11-25 23:44:28,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1058 treesize of output 1010 [2022-11-25 23:44:28,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1010 treesize of output 962 [2022-11-25 23:44:29,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 962 treesize of output 938 [2022-11-25 23:44:29,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 938 treesize of output 858 [2022-11-25 23:46:17,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:17,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2022-11-25 23:46:17,988 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:17,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2022-11-25 23:46:18,001 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 84 treesize of output 72 [2022-11-25 23:46:18,017 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 362 treesize of output 326 [2022-11-25 23:46:18,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 306 [2022-11-25 23:46:18,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 146 [2022-11-25 23:46:18,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 262 [2022-11-25 23:46:29,595 WARN L233 SmtUtils]: Spent 9.82s on a formula simplification. DAG size of input: 172 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:46:36,336 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 23:46:36,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550896115] [2022-11-25 23:46:36,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550896115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:36,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [943429149] [2022-11-25 23:46:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:36,336 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 23:46:36,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 23:46:36,338 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 23:46:36,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-11-25 23:46:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:36,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 23:46:36,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:36,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:46:36,903 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 7 [2022-11-25 23:46:37,188 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:46:37,188 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-11-25 23:46:37,216 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:46:37,217 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 13 treesize of output 13 [2022-11-25 23:46:37,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:46:37,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:46:37,357 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:46:37,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-25 23:46:37,371 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 18 treesize of output 20 [2022-11-25 23:46:37,577 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:46:37,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-25 23:46:37,587 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 18 treesize of output 20 [2022-11-25 23:46:37,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:37,707 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-11-25 23:46:37,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:46:37,719 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 31 treesize of output 26 [2022-11-25 23:46:37,846 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 25 treesize of output 13 [2022-11-25 23:46:37,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-25 23:46:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:46:37,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:39,529 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-25 23:46:39,599 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2022-11-25 23:46:39,651 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 23:46:39,724 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2022-11-25 23:46:39,767 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) is different from false [2022-11-25 23:46:39,819 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-11-25 23:46:40,047 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1900 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1899 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1899))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1900) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1900 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1899 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1900) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1899) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-11-25 23:46:42,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:42,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-11-25 23:46:42,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:46:42,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-11-25 23:46:42,851 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 334 treesize of output 290 [2022-11-25 23:46:42,861 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 1450 treesize of output 1382 [2022-11-25 23:46:42,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1378 treesize of output 1314 [2022-11-25 23:46:42,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1314 treesize of output 1250 [2022-11-25 23:46:42,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1250 treesize of output 1218 [2022-11-25 23:46:42,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1218 treesize of output 1130 [2022-11-25 23:48:40,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:48:40,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2022-11-25 23:48:40,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:48:40,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2022-11-25 23:48:40,207 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 84 treesize of output 72 [2022-11-25 23:48:40,227 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 270 treesize of output 242 [2022-11-25 23:48:40,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-25 23:48:40,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 218 [2022-11-25 23:48:40,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 194 [2022-11-25 23:48:43,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [943429149] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:43,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365372368] [2022-11-25 23:48:43,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:43,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:43,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:43,614 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:43,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04f6a1a2-4f7f-4843-b67c-7946717d4200/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-25 23:48:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:43,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-25 23:48:43,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:43,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:48:44,473 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:48:44,473 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-11-25 23:48:44,504 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 23:48:44,504 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 13 treesize of output 13 [2022-11-25 23:48:44,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:48:44,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 23:48:45,214 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:48:45,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-25 23:48:45,221 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 18 treesize of output 20 [2022-11-25 23:48:46,395 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:48:46,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 50 [2022-11-25 23:48:46,409 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 33 treesize of output 33 [2022-11-25 23:48:46,503 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 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-25 23:48:46,516 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-11-25 23:48:46,748 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 25 treesize of output 13 [2022-11-25 23:48:46,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-25 23:48:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 23:48:46,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:50,825 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1968)) (.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1969) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store .cse1 .cse2 v_ArrVal_1970) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (bvule (bvadd (_ bv8 32) (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| .cse2)))))) (forall ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1969))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1968)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (forall ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store .cse3 .cse4 v_ArrVal_1970) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1971) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (not (bvule (bvadd (_ bv8 32) (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| .cse4)))))))) is different from false [2022-11-25 23:48:50,939 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1969))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1968)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (not (bvule (bvadd (_ bv8 32) (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| .cse1))) (forall ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store .cse0 .cse1 v_ArrVal_1970) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1971) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))) (forall ((v_ArrVal_1968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1969 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1968)) (.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1969) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (not (bvule (bvadd (_ bv8 32) (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| .cse4))) (forall ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store .cse3 .cse4 v_ArrVal_1970) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse5 (_ bv4 32)) (bvadd .cse5 (_ bv8 32))))))))) is different from false [2022-11-25 23:48:50,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:48:50,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 96 [2022-11-25 23:48:51,000 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:48:51,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 72 [2022-11-25 23:48:51,008 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 130 treesize of output 114 [2022-11-25 23:48:51,015 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 260 treesize of output 232 [2022-11-25 23:48:51,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 216 [2022-11-25 23:48:51,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 133 [2022-11-25 23:48:51,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126 [2022-11-25 23:48:53,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:48:53,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 104 [2022-11-25 23:48:53,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:48:53,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 72 [2022-11-25 23:48:53,579 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 678 treesize of output 598 [2022-11-25 23:48:53,610 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 2246 treesize of output 2138 [2022-11-25 23:48:53,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2064 treesize of output 1968 [2022-11-25 23:48:53,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2038 treesize of output 1986 [2022-11-25 23:48:53,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1920 treesize of output 1824 [2022-11-25 23:48:53,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1890 treesize of output 1762