./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0 --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 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- 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-e04fb08 [2022-11-16 19:31:53,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 19:31:53,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 19:31:53,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 19:31:53,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 19:31:53,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 19:31:53,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 19:31:53,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 19:31:53,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 19:31:53,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 19:31:53,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 19:31:53,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 19:31:53,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 19:31:53,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 19:31:53,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 19:31:53,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 19:31:53,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 19:31:53,615 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 19:31:53,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 19:31:53,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 19:31:53,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 19:31:53,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 19:31:53,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 19:31:53,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 19:31:53,642 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 19:31:53,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 19:31:53,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 19:31:53,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 19:31:53,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 19:31:53,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 19:31:53,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 19:31:53,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 19:31:53,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 19:31:53,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 19:31:53,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 19:31:53,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 19:31:53,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 19:31:53,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 19:31:53,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 19:31:53,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 19:31:53,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 19:31:53,661 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-16 19:31:53,706 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 19:31:53,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 19:31:53,707 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 19:31:53,707 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 19:31:53,708 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 19:31:53,709 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 19:31:53,709 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 19:31:53,709 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 19:31:53,710 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 19:31:53,710 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 19:31:53,711 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 19:31:53,712 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 19:31:53,712 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 19:31:53,712 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 19:31:53,712 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 19:31:53,713 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 19:31:53,713 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 19:31:53,713 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 19:31:53,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 19:31:53,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 19:31:53,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 19:31:53,715 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 19:31:53,716 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 19:31:53,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 19:31:53,716 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 19:31:53,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 19:31:53,717 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 19:31:53,717 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 19:31:53,718 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 19:31:53,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 19:31:53,718 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 19:31:53,719 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 19:31:53,719 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 19:31:53,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 19:31:53,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 19:31:53,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:31:53,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 19:31:53,720 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 19:31:53,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 19:31:53,721 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 19:31:53,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 19:31:53,721 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 19:31:53,722 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_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/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_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0 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 -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2022-11-16 19:31:54,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 19:31:54,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 19:31:54,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 19:31:54,125 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 19:31:54,126 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 19:31:54,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2022-11-16 19:31:54,206 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/data/4a8938ce3/6989bbed1dbb4fc6800188ad27bdf1c1/FLAGdaf7b106e [2022-11-16 19:31:54,747 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 19:31:54,753 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2022-11-16 19:31:54,769 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/data/4a8938ce3/6989bbed1dbb4fc6800188ad27bdf1c1/FLAGdaf7b106e [2022-11-16 19:31:55,067 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/data/4a8938ce3/6989bbed1dbb4fc6800188ad27bdf1c1 [2022-11-16 19:31:55,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 19:31:55,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 19:31:55,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 19:31:55,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 19:31:55,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 19:31:55,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b295b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55, skipping insertion in model container [2022-11-16 19:31:55,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 19:31:55,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 19:31:55,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:31:55,530 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 19:31:55,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 19:31:55,642 INFO L208 MainTranslator]: Completed translation [2022-11-16 19:31:55,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55 WrapperNode [2022-11-16 19:31:55,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 19:31:55,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 19:31:55,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 19:31:55,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 19:31:55,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,712 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-11-16 19:31:55,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 19:31:55,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 19:31:55,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 19:31:55,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 19:31:55,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,765 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 19:31:55,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 19:31:55,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 19:31:55,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 19:31:55,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (1/1) ... [2022-11-16 19:31:55,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 19:31:55,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:31:55,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 19:31:55,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 19:31:55,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 19:31:55,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 19:31:55,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 19:31:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 19:31:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 19:31:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 19:31:55,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 19:31:55,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 19:31:56,023 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 19:31:56,041 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 19:31:56,662 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 19:31:56,739 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 19:31:56,744 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 19:31:56,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:31:56 BoogieIcfgContainer [2022-11-16 19:31:56,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 19:31:56,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 19:31:56,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 19:31:56,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 19:31:56,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:31:55" (1/3) ... [2022-11-16 19:31:56,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8773c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:31:56, skipping insertion in model container [2022-11-16 19:31:56,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:31:55" (2/3) ... [2022-11-16 19:31:56,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8773c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:31:56, skipping insertion in model container [2022-11-16 19:31:56,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 07:31:56" (3/3) ... [2022-11-16 19:31:56,766 INFO L112 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2022-11-16 19:31:56,790 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 19:31:56,790 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-11-16 19:31:56,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 19:31:56,866 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;@35985ecd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 19:31:56,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-11-16 19:31:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 47 states have (on average 2.574468085106383) internal successors, (121), 112 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 19:31:56,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:56,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 19:31:56,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:31:56,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash 7227, now seen corresponding path program 1 times [2022-11-16 19:31:56,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:31:56,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992577589] [2022-11-16 19:31:56,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:31:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:57,263 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-16 19:31:57,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:31:57,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992577589] [2022-11-16 19:31:57,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992577589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:31:57,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:31:57,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 19:31:57,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893841547] [2022-11-16 19:31:57,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:31:57,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:31:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:31:57,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:31:57,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:31:57,319 INFO L87 Difference]: Start difference. First operand has 113 states, 47 states have (on average 2.574468085106383) internal successors, (121), 112 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:31:57,577 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-11-16 19:31:57,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:31:57,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-16 19:31:57,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:31:57,589 INFO L225 Difference]: With dead ends: 134 [2022-11-16 19:31:57,590 INFO L226 Difference]: Without dead ends: 133 [2022-11-16 19:31:57,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:31:57,595 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 103 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:31:57,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 60 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:31:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-16 19:31:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2022-11-16 19:31:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 104 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2022-11-16 19:31:57,636 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 2 [2022-11-16 19:31:57,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:31:57,637 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2022-11-16 19:31:57,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-11-16 19:31:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-16 19:31:57,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:57,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-16 19:31:57,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 19:31:57,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:31:57,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:57,640 INFO L85 PathProgramCache]: Analyzing trace with hash 7228, now seen corresponding path program 1 times [2022-11-16 19:31:57,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:31:57,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973675056] [2022-11-16 19:31:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:57,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:31:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:57,783 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-16 19:31:57,783 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:31:57,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973675056] [2022-11-16 19:31:57,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973675056] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:31:57,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:31:57,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 19:31:57,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749199321] [2022-11-16 19:31:57,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:31:57,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 19:31:57,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:31:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 19:31:57,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:31:57,804 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:31:57,956 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-11-16 19:31:57,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 19:31:57,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-16 19:31:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:31:57,958 INFO L225 Difference]: With dead ends: 98 [2022-11-16 19:31:57,959 INFO L226 Difference]: Without dead ends: 98 [2022-11-16 19:31:57,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 19:31:57,966 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:31:57,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 48 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:31:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-16 19:31:57,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-11-16 19:31:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 47 states have (on average 2.1702127659574466) internal successors, (102), 97 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-11-16 19:31:57,980 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 2 [2022-11-16 19:31:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:31:57,980 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-11-16 19:31:57,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-11-16 19:31:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 19:31:57,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:57,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:57,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 19:31:57,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:31:57,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:57,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1853344572, now seen corresponding path program 1 times [2022-11-16 19:31:57,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:31:57,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501864702] [2022-11-16 19:31:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:57,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:31:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:58,185 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-16 19:31:58,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:31:58,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501864702] [2022-11-16 19:31:58,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501864702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:31:58,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:31:58,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:31:58,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851137468] [2022-11-16 19:31:58,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:31:58,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:31:58,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:31:58,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:31:58,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:31:58,188 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:58,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:31:58,410 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-11-16 19:31:58,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:31:58,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-16 19:31:58,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:31:58,411 INFO L225 Difference]: With dead ends: 97 [2022-11-16 19:31:58,412 INFO L226 Difference]: Without dead ends: 97 [2022-11-16 19:31:58,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:31:58,413 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 7 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:31:58,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 207 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:31:58,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-16 19:31:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-16 19:31:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.148936170212766) internal successors, (101), 96 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2022-11-16 19:31:58,428 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 7 [2022-11-16 19:31:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:31:58,429 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2022-11-16 19:31:58,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-11-16 19:31:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 19:31:58,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:58,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:58,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 19:31:58,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:31:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1853344571, now seen corresponding path program 1 times [2022-11-16 19:31:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:31:58,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749588552] [2022-11-16 19:31:58,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:31:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:58,808 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-16 19:31:58,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:31:58,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749588552] [2022-11-16 19:31:58,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749588552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:31:58,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:31:58,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:31:58,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344463745] [2022-11-16 19:31:58,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:31:58,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:31:58,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:31:58,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:31:58,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:31:58,814 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:31:59,080 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-11-16 19:31:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:31:59,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-16 19:31:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:31:59,081 INFO L225 Difference]: With dead ends: 96 [2022-11-16 19:31:59,081 INFO L226 Difference]: Without dead ends: 96 [2022-11-16 19:31:59,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:31:59,083 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:31:59,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 194 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:31:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-16 19:31:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-16 19:31:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 47 states have (on average 2.127659574468085) internal successors, (100), 95 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-11-16 19:31:59,088 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 7 [2022-11-16 19:31:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:31:59,089 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-11-16 19:31:59,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-11-16 19:31:59,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 19:31:59,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:59,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:59,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 19:31:59,090 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:31:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1619106891, now seen corresponding path program 1 times [2022-11-16 19:31:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:31:59,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489216733] [2022-11-16 19:31:59,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:59,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:31:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:59,186 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-16 19:31:59,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:31:59,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489216733] [2022-11-16 19:31:59,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489216733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:31:59,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:31:59,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:31:59,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979266939] [2022-11-16 19:31:59,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:31:59,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:31:59,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:31:59,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:31:59,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:31:59,189 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:31:59,344 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2022-11-16 19:31:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:31:59,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-16 19:31:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:31:59,345 INFO L225 Difference]: With dead ends: 95 [2022-11-16 19:31:59,346 INFO L226 Difference]: Without dead ends: 95 [2022-11-16 19:31:59,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:31:59,353 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:31:59,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 266 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:31:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-16 19:31:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-16 19:31:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 47 states have (on average 2.106382978723404) internal successors, (99), 94 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2022-11-16 19:31:59,362 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 8 [2022-11-16 19:31:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:31:59,363 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2022-11-16 19:31:59,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2022-11-16 19:31:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 19:31:59,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:59,364 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:59,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 19:31:59,364 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:31:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1619106890, now seen corresponding path program 1 times [2022-11-16 19:31:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:31:59,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717059825] [2022-11-16 19:31:59,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:31:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:31:59,728 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-16 19:31:59,728 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:31:59,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717059825] [2022-11-16 19:31:59,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717059825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:31:59,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:31:59,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 19:31:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233917679] [2022-11-16 19:31:59,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:31:59,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:31:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:31:59,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:31:59,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:31:59,731 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:31:59,982 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-11-16 19:31:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 19:31:59,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-16 19:31:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:31:59,984 INFO L225 Difference]: With dead ends: 94 [2022-11-16 19:31:59,984 INFO L226 Difference]: Without dead ends: 94 [2022-11-16 19:31:59,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-16 19:31:59,985 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 8 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:31:59,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 192 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:31:59,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-16 19:31:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-16 19:31:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 47 states have (on average 2.0851063829787235) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-11-16 19:31:59,990 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 8 [2022-11-16 19:31:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:31:59,990 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-11-16 19:31:59,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:31:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-11-16 19:31:59,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 19:31:59,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:31:59,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:31:59,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 19:31:59,992 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:31:59,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:31:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1969462558, now seen corresponding path program 1 times [2022-11-16 19:31:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:31:59,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263519624] [2022-11-16 19:31:59,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:31:59,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:00,285 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-16 19:32:00,285 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:00,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263519624] [2022-11-16 19:32:00,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263519624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:00,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:00,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:32:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995753463] [2022-11-16 19:32:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:00,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 19:32:00,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:00,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 19:32:00,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-16 19:32:00,287 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:00,612 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-11-16 19:32:00,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 19:32:00,613 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 19:32:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:00,613 INFO L225 Difference]: With dead ends: 93 [2022-11-16 19:32:00,614 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 19:32:00,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-16 19:32:00,615 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:00,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 389 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:32:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 19:32:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-16 19:32:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 92 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2022-11-16 19:32:00,619 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 11 [2022-11-16 19:32:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:00,619 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2022-11-16 19:32:00,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2022-11-16 19:32:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 19:32:00,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:00,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:00,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 19:32:00,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:00,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:00,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1969462559, now seen corresponding path program 1 times [2022-11-16 19:32:00,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:00,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386268837] [2022-11-16 19:32:00,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:01,150 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-16 19:32:01,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:01,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386268837] [2022-11-16 19:32:01,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386268837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:01,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:01,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 19:32:01,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483358839] [2022-11-16 19:32:01,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:01,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 19:32:01,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:01,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 19:32:01,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-16 19:32:01,152 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:01,421 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-11-16 19:32:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 19:32:01,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 19:32:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:01,424 INFO L225 Difference]: With dead ends: 92 [2022-11-16 19:32:01,424 INFO L226 Difference]: Without dead ends: 92 [2022-11-16 19:32:01,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-11-16 19:32:01,432 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:01,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 323 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 19:32:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-16 19:32:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-16 19:32:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 91 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-11-16 19:32:01,437 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 11 [2022-11-16 19:32:01,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:01,438 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-11-16 19:32:01,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-11-16 19:32:01,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 19:32:01,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:01,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:01,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 19:32:01,439 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash 923797160, now seen corresponding path program 1 times [2022-11-16 19:32:01,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:01,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143208003] [2022-11-16 19:32:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:01,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:01,561 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-16 19:32:01,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:01,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143208003] [2022-11-16 19:32:01,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143208003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:01,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:01,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:32:01,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491580894] [2022-11-16 19:32:01,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:01,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:32:01,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:01,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:32:01,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:32:01,566 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:01,727 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-11-16 19:32:01,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:32:01,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 19:32:01,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:01,728 INFO L225 Difference]: With dead ends: 91 [2022-11-16 19:32:01,728 INFO L226 Difference]: Without dead ends: 91 [2022-11-16 19:32:01,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:32:01,732 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:01,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:32:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-16 19:32:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-16 19:32:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 2.021276595744681) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:01,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2022-11-16 19:32:01,741 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 12 [2022-11-16 19:32:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:01,742 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2022-11-16 19:32:01,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-11-16 19:32:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 19:32:01,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:01,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:01,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 19:32:01,744 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:01,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:01,749 INFO L85 PathProgramCache]: Analyzing trace with hash 923797161, now seen corresponding path program 1 times [2022-11-16 19:32:01,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:01,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775892752] [2022-11-16 19:32:01,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:02,313 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-16 19:32:02,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:02,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775892752] [2022-11-16 19:32:02,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775892752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:02,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:02,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-16 19:32:02,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739005123] [2022-11-16 19:32:02,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:02,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 19:32:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:02,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 19:32:02,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-11-16 19:32:02,316 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:02,699 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-11-16 19:32:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 19:32:02,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 19:32:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:02,700 INFO L225 Difference]: With dead ends: 90 [2022-11-16 19:32:02,700 INFO L226 Difference]: Without dead ends: 90 [2022-11-16 19:32:02,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:32:02,701 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 14 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:02,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 406 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:32:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-16 19:32:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-16 19:32:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 47 states have (on average 2.0) internal successors, (94), 89 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:02,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-11-16 19:32:02,704 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 12 [2022-11-16 19:32:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:02,704 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-11-16 19:32:02,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-11-16 19:32:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 19:32:02,705 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:02,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:02,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 19:32:02,706 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1304218271, now seen corresponding path program 1 times [2022-11-16 19:32:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:02,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802964945] [2022-11-16 19:32:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:02,815 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-16 19:32:02,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:02,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802964945] [2022-11-16 19:32:02,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802964945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:02,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:02,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:32:02,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430795864] [2022-11-16 19:32:02,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:02,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:32:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:02,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:32:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:32:02,818 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:02,982 INFO L93 Difference]: Finished difference Result 147 states and 154 transitions. [2022-11-16 19:32:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:32:02,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 19:32:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:02,984 INFO L225 Difference]: With dead ends: 147 [2022-11-16 19:32:02,984 INFO L226 Difference]: Without dead ends: 147 [2022-11-16 19:32:02,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-16 19:32:02,985 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 227 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:02,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 101 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:32:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-16 19:32:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 88. [2022-11-16 19:32:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.9574468085106382) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-11-16 19:32:02,988 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 15 [2022-11-16 19:32:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:02,989 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-11-16 19:32:02,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-11-16 19:32:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 19:32:02,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:02,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:02,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 19:32:02,990 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:02,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1304218270, now seen corresponding path program 1 times [2022-11-16 19:32:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:02,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462341234] [2022-11-16 19:32:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:03,154 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-16 19:32:03,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:03,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462341234] [2022-11-16 19:32:03,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462341234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:03,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:03,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:32:03,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396111376] [2022-11-16 19:32:03,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:03,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:32:03,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:03,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:32:03,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:32:03,157 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:03,313 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-11-16 19:32:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:32:03,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 19:32:03,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:03,314 INFO L225 Difference]: With dead ends: 119 [2022-11-16 19:32:03,314 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 19:32:03,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:32:03,315 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 318 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:03,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 82 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:32:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 19:32:03,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 86. [2022-11-16 19:32:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-11-16 19:32:03,318 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 15 [2022-11-16 19:32:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:03,318 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-11-16 19:32:03,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-11-16 19:32:03,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:32:03,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:03,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:03,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 19:32:03,319 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1776059592, now seen corresponding path program 1 times [2022-11-16 19:32:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:03,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560018708] [2022-11-16 19:32:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:03,428 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-16 19:32:03,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:03,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560018708] [2022-11-16 19:32:03,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560018708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:03,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:03,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:32:03,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140288782] [2022-11-16 19:32:03,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:03,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:32:03,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:03,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:32:03,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:32:03,432 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:03,604 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-11-16 19:32:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:32:03,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 19:32:03,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:03,606 INFO L225 Difference]: With dead ends: 105 [2022-11-16 19:32:03,606 INFO L226 Difference]: Without dead ends: 105 [2022-11-16 19:32:03,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-16 19:32:03,606 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 179 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:03,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 73 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:32:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-16 19:32:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2022-11-16 19:32:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-11-16 19:32:03,610 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 16 [2022-11-16 19:32:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:03,610 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-11-16 19:32:03,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-11-16 19:32:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:32:03,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:03,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:03,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 19:32:03,611 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:03,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:03,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1776059591, now seen corresponding path program 1 times [2022-11-16 19:32:03,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:03,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109400620] [2022-11-16 19:32:03,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:03,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:03,768 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-16 19:32:03,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:03,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109400620] [2022-11-16 19:32:03,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109400620] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:03,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:03,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:32:03,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054443016] [2022-11-16 19:32:03,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:03,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 19:32:03,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:03,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 19:32:03,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 19:32:03,770 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:03,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:03,910 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-11-16 19:32:03,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:32:03,911 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 19:32:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:03,911 INFO L225 Difference]: With dead ends: 78 [2022-11-16 19:32:03,912 INFO L226 Difference]: Without dead ends: 78 [2022-11-16 19:32:03,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-16 19:32:03,912 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 165 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:03,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 52 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:32:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-16 19:32:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-16 19:32:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-11-16 19:32:03,915 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 16 [2022-11-16 19:32:03,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:03,915 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-11-16 19:32:03,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:03,916 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-11-16 19:32:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:32:03,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:03,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:03,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 19:32:03,916 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:03,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1776055964, now seen corresponding path program 1 times [2022-11-16 19:32:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:03,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776838768] [2022-11-16 19:32:03,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:04,473 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-16 19:32:04,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:04,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776838768] [2022-11-16 19:32:04,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776838768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:04,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:04,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 19:32:04,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211885082] [2022-11-16 19:32:04,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:04,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 19:32:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:04,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 19:32:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-16 19:32:04,475 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:05,119 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2022-11-16 19:32:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 19:32:05,120 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 19:32:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:05,121 INFO L225 Difference]: With dead ends: 135 [2022-11-16 19:32:05,121 INFO L226 Difference]: Without dead ends: 135 [2022-11-16 19:32:05,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-11-16 19:32:05,122 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 240 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:05,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 419 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 19:32:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-16 19:32:05,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 78. [2022-11-16 19:32:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 77 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-11-16 19:32:05,125 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 16 [2022-11-16 19:32:05,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:05,125 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-11-16 19:32:05,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-11-16 19:32:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 19:32:05,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:05,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:05,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 19:32:05,127 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1776055963, now seen corresponding path program 1 times [2022-11-16 19:32:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:05,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477513180] [2022-11-16 19:32:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:05,977 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-16 19:32:05,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:05,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477513180] [2022-11-16 19:32:05,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477513180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:05,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:05,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 19:32:05,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525728825] [2022-11-16 19:32:05,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:05,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 19:32:05,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:05,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 19:32:05,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:32:05,980 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:06,782 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2022-11-16 19:32:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 19:32:06,783 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 19:32:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:06,784 INFO L225 Difference]: With dead ends: 171 [2022-11-16 19:32:06,784 INFO L226 Difference]: Without dead ends: 171 [2022-11-16 19:32:06,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-11-16 19:32:06,785 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 296 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:06,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 607 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 19:32:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-16 19:32:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 94. [2022-11-16 19:32:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 93 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2022-11-16 19:32:06,789 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 16 [2022-11-16 19:32:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:06,789 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2022-11-16 19:32:06,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2022-11-16 19:32:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 19:32:06,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:06,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:06,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 19:32:06,791 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:06,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash -889058873, now seen corresponding path program 1 times [2022-11-16 19:32:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:06,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723178045] [2022-11-16 19:32:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:06,873 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-16 19:32:06,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:06,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723178045] [2022-11-16 19:32:06,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723178045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:06,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:06,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:32:06,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105148825] [2022-11-16 19:32:06,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:06,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:32:06,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:06,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:32:06,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:32:06,876 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:06,958 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2022-11-16 19:32:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 19:32:06,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 19:32:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:06,960 INFO L225 Difference]: With dead ends: 93 [2022-11-16 19:32:06,960 INFO L226 Difference]: Without dead ends: 93 [2022-11-16 19:32:06,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-16 19:32:06,961 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 144 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:06,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 83 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:32:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-16 19:32:06,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-16 19:32:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.661764705882353) internal successors, (113), 92 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:06,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2022-11-16 19:32:06,966 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 19 [2022-11-16 19:32:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:06,966 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2022-11-16 19:32:06,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:06,967 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2022-11-16 19:32:06,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 19:32:06,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:06,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:06,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 19:32:06,968 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:06,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:06,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1790938163, now seen corresponding path program 1 times [2022-11-16 19:32:06,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:06,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029093378] [2022-11-16 19:32:06,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:06,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:07,489 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-16 19:32:07,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:07,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029093378] [2022-11-16 19:32:07,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029093378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:07,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:07,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 19:32:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560356935] [2022-11-16 19:32:07,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:07,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 19:32:07,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:07,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 19:32:07,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-16 19:32:07,493 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:07,946 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2022-11-16 19:32:07,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 19:32:07,947 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 19:32:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:07,947 INFO L225 Difference]: With dead ends: 130 [2022-11-16 19:32:07,947 INFO L226 Difference]: Without dead ends: 130 [2022-11-16 19:32:07,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-11-16 19:32:07,948 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 132 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:07,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 329 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:32:07,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-16 19:32:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 99. [2022-11-16 19:32:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.635135135135135) internal successors, (121), 98 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2022-11-16 19:32:07,952 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 20 [2022-11-16 19:32:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:07,952 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2022-11-16 19:32:07,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:07,952 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2022-11-16 19:32:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 19:32:07,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:07,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:07,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 19:32:07,953 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:07,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:07,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1790938162, now seen corresponding path program 1 times [2022-11-16 19:32:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:07,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953428873] [2022-11-16 19:32:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:08,838 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-16 19:32:08,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:08,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953428873] [2022-11-16 19:32:08,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953428873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:08,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:08,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 19:32:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893761028] [2022-11-16 19:32:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:08,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 19:32:08,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:08,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 19:32:08,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:32:08,840 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:09,479 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2022-11-16 19:32:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 19:32:09,480 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 19:32:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:09,481 INFO L225 Difference]: With dead ends: 129 [2022-11-16 19:32:09,481 INFO L226 Difference]: Without dead ends: 129 [2022-11-16 19:32:09,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2022-11-16 19:32:09,488 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 133 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:09,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 353 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 19:32:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-16 19:32:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2022-11-16 19:32:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 98 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2022-11-16 19:32:09,508 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 20 [2022-11-16 19:32:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:09,509 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2022-11-16 19:32:09,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2022-11-16 19:32:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 19:32:09,511 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:09,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:09,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 19:32:09,512 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:09,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1561162812, now seen corresponding path program 1 times [2022-11-16 19:32:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:09,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068543858] [2022-11-16 19:32:09,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:09,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:09,595 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-16 19:32:09,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:09,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068543858] [2022-11-16 19:32:09,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068543858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:09,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:09,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 19:32:09,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140164616] [2022-11-16 19:32:09,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:09,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 19:32:09,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:09,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 19:32:09,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 19:32:09,599 INFO L87 Difference]: Start difference. First operand 99 states and 120 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:09,734 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2022-11-16 19:32:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 19:32:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 19:32:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:09,736 INFO L225 Difference]: With dead ends: 115 [2022-11-16 19:32:09,736 INFO L226 Difference]: Without dead ends: 115 [2022-11-16 19:32:09,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:32:09,737 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 93 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:09,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 80 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:32:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-16 19:32:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2022-11-16 19:32:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.5526315789473684) internal successors, (118), 97 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-11-16 19:32:09,741 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 20 [2022-11-16 19:32:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:09,742 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-11-16 19:32:09,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:09,742 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-11-16 19:32:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 19:32:09,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:09,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:09,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 19:32:09,744 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:09,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1561162813, now seen corresponding path program 1 times [2022-11-16 19:32:09,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:09,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914375953] [2022-11-16 19:32:09,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:09,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:10,652 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-16 19:32:10,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:10,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914375953] [2022-11-16 19:32:10,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914375953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:32:10,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:32:10,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-16 19:32:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920115191] [2022-11-16 19:32:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:32:10,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-16 19:32:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:32:10,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-16 19:32:10,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-11-16 19:32:10,654 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:11,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:32:11,322 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-11-16 19:32:11,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 19:32:11,323 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 19:32:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:32:11,324 INFO L225 Difference]: With dead ends: 165 [2022-11-16 19:32:11,324 INFO L226 Difference]: Without dead ends: 165 [2022-11-16 19:32:11,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-11-16 19:32:11,325 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 364 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 19:32:11,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 544 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 19:32:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-16 19:32:11,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 101. [2022-11-16 19:32:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 100 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2022-11-16 19:32:11,329 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 20 [2022-11-16 19:32:11,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:32:11,329 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2022-11-16 19:32:11,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:32:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2022-11-16 19:32:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 19:32:11,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:32:11,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:32:11,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 19:32:11,330 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:32:11,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:32:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1561168610, now seen corresponding path program 1 times [2022-11-16 19:32:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:32:11,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277977037] [2022-11-16 19:32:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:11,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:32:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:32:12,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:32:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277977037] [2022-11-16 19:32:12,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277977037] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:32:12,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239774298] [2022-11-16 19:32:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:32:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:32:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:32:12,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:32:12,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 19:32:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:32:13,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-16 19:32:13,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:32:13,359 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 19:32:13,360 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 19 treesize of output 18 [2022-11-16 19:32:13,444 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-16 19:32:13,498 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-16 19:32:13,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-11-16 19:32:13,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:32:13,607 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 39 treesize of output 30 [2022-11-16 19:32:14,045 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 19:32:14,046 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 89 treesize of output 76 [2022-11-16 19:32:14,072 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 18 treesize of output 20 [2022-11-16 19:32:14,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:32:14,200 INFO L321 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-11-16 19:32:14,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 61 [2022-11-16 19:32:14,219 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 93 treesize of output 89 [2022-11-16 19:32:14,593 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 19:32:14,594 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 112 [2022-11-16 19:32:14,616 INFO L321 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-11-16 19:32:14,616 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 95 treesize of output 91 [2022-11-16 19:32:14,681 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 19:32:14,682 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 99 [2022-11-16 19:32:14,699 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 19:32:14,699 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 91 treesize of output 87 [2022-11-16 19:32:14,933 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 88 treesize of output 68 [2022-11-16 19:32:15,188 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-16 19:32:15,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 95 treesize of output 32 [2022-11-16 19:32:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:32:15,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 19:32:15,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_809 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_809))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_810) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) 1)) is different from false [2022-11-16 19:32:18,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_809 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_809))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_804) .cse2 v_ArrVal_810) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))))) 1)) is different from false [2022-11-16 19:32:18,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_809 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_802))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_809))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_803) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_804) .cse2 v_ArrVal_810) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))) 1)) is different from false [2022-11-16 19:32:18,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_809 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_802))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_809))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_803) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_804) .cse2 v_ArrVal_810) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4)))))) 1)) is different from false [2022-11-16 19:32:18,132 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (v_ArrVal_809 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_802))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 4) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_809))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_803) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_804) .cse2 v_ArrVal_810) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))))))) 1)) is different from false [2022-11-16 19:32:18,147 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 644 treesize of output 560 [2022-11-16 19:32:18,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:32:18,156 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 560 treesize of output 354 [2022-11-16 19:32:18,165 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 170 treesize of output 168 [2022-11-16 19:32:18,172 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 338 treesize of output 334 [2022-11-16 19:32:18,646 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse5 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse6 (select .cse36 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse16 (= .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse1 (select .cse36 .cse5))) (let ((.cse7 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse34 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select |c_#valid| (select (let ((.cse33 (store .cse34 .cse35 v_ArrVal_809))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 v_arrayElimCell_23))) 1)) (not (= .cse35 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse1))))))) (.cse20 (not .cse16))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse1)) (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse2 (let ((.cse3 (store .cse4 .cse0 v_ArrVal_809))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse2 (+ 4 v_arrayElimCell_23))) 1) (= (select |c_#valid| (select .cse2 (+ 4 v_arrayElimCell_22))) 1)))))))) .cse7 (or (and .cse7 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse9 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (store .cse11 (select (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_809)))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse8 .cse9)) 1) (= (select |c_#valid| (select .cse8 (+ 4 v_arrayElimCell_23))) 1)))) (not (= (select v_arrayElimArr_1 .cse9) .cse1))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse12 (+ 4 v_arrayElimCell_21)) (.cse15 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_1 .cse12) .cse1)) (forall ((v_ArrVal_809 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse13 (store .cse14 .cse15 v_ArrVal_809))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) .cse12)) 1)) (= .cse15 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)))))) .cse16) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (or (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse1)) (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse17 (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_809)))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_22 Int)) (= (select |c_#valid| (select .cse17 (+ 4 v_arrayElimCell_22))) 1)) (= (select |c_#valid| (select .cse17 (+ 4 v_arrayElimCell_23))) 1)))))) .cse7) .cse20) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse1)) (= (select |c_#valid| (select (let ((.cse21 (store .cse22 .cse23 v_ArrVal_809))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 v_arrayElimCell_22))) 1) (= .cse23 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) .cse20) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse28 (select (select .cse27 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_arrayElimCell_21 Int)) (let ((.cse24 (+ 4 v_arrayElimCell_21))) (or (not (= (select v_arrayElimArr_1 .cse24) .cse1)) (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse25 (let ((.cse26 (store .cse27 .cse28 v_ArrVal_809))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse25 .cse24)) 1) (= (select |c_#valid| (select .cse25 (+ 4 v_arrayElimCell_22))) 1))))))) (= .cse28 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse29 (+ 4 v_arrayElimCell_21))) (or (not (= (select v_arrayElimArr_1 .cse29) .cse1)) (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse30 (let ((.cse31 (let ((.cse32 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (store .cse32 (select (select .cse32 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_809)))) (select .cse31 (select (select .cse31 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse30 .cse29)) 1) (= (select |c_#valid| (select .cse30 (+ 4 v_arrayElimCell_23))) 1) (= (select |c_#valid| (select .cse30 (+ 4 v_arrayElimCell_22))) 1)))))))))))) is different from false [2022-11-16 19:32:18,988 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse36 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse6 (select .cse36 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse36 .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))) (.cse12 (= .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse25 (not .cse12)) (.cse11 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse35 (store .cse5 .cse6 v_arrayElimArr_1))) (let ((.cse33 (select (select .cse35 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (not (= .cse33 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select |c_#valid| (select (let ((.cse34 (store .cse35 .cse33 v_ArrVal_809))) (select .cse34 (select (select .cse34 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 v_arrayElimCell_23))) 1)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))))) (and (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse1 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store .cse5 .cse6 v_arrayElimArr_1))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_809)))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse0 .cse1)) 1) (= (select |c_#valid| (select .cse0 (+ 4 v_arrayElimCell_23))) 1)))) (not (= (select v_arrayElimArr_1 .cse1) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse9 (store .cse5 .cse6 v_arrayElimArr_1))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4)) (.cse10 (+ 4 v_arrayElimCell_21))) (or (= .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_ArrVal_809 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse8 (store .cse9 .cse7 v_ArrVal_809))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) .cse10)) 1)) (not (= (select v_arrayElimArr_1 .cse10) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) .cse11) .cse12) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse16 (store .cse5 .cse6 v_arrayElimArr_1))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (not (= .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse14 (let ((.cse15 (store .cse16 .cse13 v_ArrVal_809))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse14 (+ 4 v_arrayElimCell_22))) 1) (= (select |c_#valid| (select .cse14 (+ 4 v_arrayElimCell_23))) 1)))) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse21 (store .cse5 .cse6 v_arrayElimArr_1))) (let ((.cse17 (select (select .cse21 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (= .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_arrayElimCell_21 Int)) (let ((.cse19 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse18 (let ((.cse20 (store .cse21 .cse17 v_ArrVal_809))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse18 .cse19)) 1) (= (select |c_#valid| (select .cse18 (+ 4 v_arrayElimCell_22))) 1)))) (not (= (select v_arrayElimArr_1 .cse19) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))))))) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse22 (let ((.cse23 (let ((.cse24 (store .cse5 .cse6 v_arrayElimArr_1))) (store .cse24 (select (select .cse24 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_809)))) (select .cse23 (select (select .cse23 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (forall ((v_arrayElimCell_22 Int)) (= (select |c_#valid| (select .cse22 (+ 4 v_arrayElimCell_22))) 1)) (= (select |c_#valid| (select .cse22 (+ 4 v_arrayElimCell_23))) 1)))) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) .cse11) .cse25) (or (forall ((v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_21 Int) (v_arrayElimCell_22 Int)) (let ((.cse28 (store .cse5 .cse6 v_arrayElimArr_1))) (let ((.cse26 (select (select .cse28 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (= .cse26 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (= (select |c_#valid| (select (let ((.cse27 (store .cse28 .cse26 v_ArrVal_809))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 4 v_arrayElimCell_22))) 1) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) .cse25) .cse11 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse30 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_809 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse29 (let ((.cse31 (let ((.cse32 (store .cse5 .cse6 v_arrayElimArr_1))) (store .cse32 (select (select .cse32 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_809)))) (select .cse31 (select (select .cse31 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse29 .cse30)) 1) (= (select |c_#valid| (select .cse29 (+ 4 v_arrayElimCell_22))) 1) (= (select |c_#valid| (select .cse29 (+ 4 v_arrayElimCell_23))) 1)))) (not (= (select v_arrayElimArr_1 .cse30) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))))))) is different from false [2022-11-16 19:32:19,217 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:32:19,218 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 2 case distinctions, treesize of input 1885 treesize of output 981 [2022-11-16 19:36:43,213 WARN L233 SmtUtils]: Spent 4.39m on a formula simplification. DAG size of input: 4182 DAG size of output: 2700 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 19:36:43,237 INFO L321 Elim1Store]: treesize reduction 6450, result has 59.9 percent of original size [2022-11-16 19:36:43,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 50 select indices, 50 select index equivalence classes, 0 disjoint index pairs (out of 1225 index pairs), introduced 51 new quantified variables, introduced 1225 case distinctions, treesize of input 41980 treesize of output 40814 [2022-11-16 19:37:03,541 WARN L233 SmtUtils]: Spent 20.29s on a formula simplification. DAG size of input: 4450 DAG size of output: 4450 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:37:22,556 WARN L233 SmtUtils]: Spent 18.39s on a formula simplification. DAG size of input: 4409 DAG size of output: 4409 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:37:23,411 INFO L217 Elim1Store]: Index analysis took 120 ms [2022-11-16 19:37:24,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:37:24,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 30950 treesize of output 30470 [2022-11-16 19:37:33,568 WARN L233 SmtUtils]: Spent 9.43s on a formula simplification that was a NOOP. DAG size: 4423 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:37:34,680 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:37:34,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30550 treesize of output 30354 [2022-11-16 19:37:44,377 WARN L233 SmtUtils]: Spent 9.69s on a formula simplification that was a NOOP. DAG size: 4431 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:37:45,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:37:45,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30010 treesize of output 29568 [2022-11-16 19:37:55,396 WARN L233 SmtUtils]: Spent 9.76s on a formula simplification that was a NOOP. DAG size: 4436 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:37:56,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:37:56,287 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 29616 treesize of output 29430 [2022-11-16 19:38:05,421 WARN L233 SmtUtils]: Spent 9.13s on a formula simplification that was a NOOP. DAG size: 4438 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:38:06,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:38:06,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 29486 treesize of output 28790 [2022-11-16 19:38:16,586 WARN L233 SmtUtils]: Spent 9.79s on a formula simplification that was a NOOP. DAG size: 4455 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:38:17,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:38:17,657 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 28812 treesize of output 28578 [2022-11-16 19:38:27,748 WARN L233 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 4457 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:38:28,796 INFO L217 Elim1Store]: Index analysis took 247 ms [2022-11-16 19:38:30,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:38:30,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 29422 treesize of output 28296 [2022-11-16 19:38:40,856 WARN L233 SmtUtils]: Spent 10.39s on a formula simplification that was a NOOP. DAG size: 4483 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:38:41,821 INFO L217 Elim1Store]: Index analysis took 153 ms [2022-11-16 19:38:42,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:38:42,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 28392 treesize of output 28002 [2022-11-16 19:38:52,644 WARN L233 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 4500 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:38:53,414 INFO L217 Elim1Store]: Index analysis took 112 ms [2022-11-16 19:38:53,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:38:53,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 27746 treesize of output 26974 [2022-11-16 19:39:02,908 WARN L233 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 4514 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:39:04,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:39:04,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27054 treesize of output 26778 [2022-11-16 19:39:14,312 WARN L233 SmtUtils]: Spent 10.17s on a formula simplification that was a NOOP. DAG size: 4522 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:39:15,216 INFO L217 Elim1Store]: Index analysis took 138 ms [2022-11-16 19:39:16,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:39:16,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 26866 treesize of output 26420 [2022-11-16 19:39:25,580 WARN L233 SmtUtils]: Spent 8.99s on a formula simplification that was a NOOP. DAG size: 4552 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:39:27,155 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:39:27,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 26062 treesize of output 25690 [2022-11-16 19:39:36,976 WARN L233 SmtUtils]: Spent 9.81s on a formula simplification that was a NOOP. DAG size: 4569 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:39:37,789 INFO L217 Elim1Store]: Index analysis took 101 ms [2022-11-16 19:39:38,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:39:38,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26114 treesize of output 25918 [2022-11-16 19:39:47,342 WARN L233 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 4577 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:39:48,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:39:48,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25612 treesize of output 25368 [2022-11-16 19:39:57,449 WARN L233 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 4594 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:39:58,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:39:58,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25390 treesize of output 25010 [2022-11-16 19:40:08,547 WARN L233 SmtUtils]: Spent 9.72s on a formula simplification that was a NOOP. DAG size: 4611 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:40:09,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:40:09,501 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 25032 treesize of output 24886 [2022-11-16 19:40:19,249 WARN L233 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 4613 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:40:20,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:40:20,224 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 24942 treesize of output 24780 [2022-11-16 19:40:29,797 WARN L233 SmtUtils]: Spent 9.56s on a formula simplification that was a NOOP. DAG size: 4615 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:40:30,547 INFO L217 Elim1Store]: Index analysis took 118 ms [2022-11-16 19:40:31,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:40:31,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 25222 treesize of output 24396 [2022-11-16 19:40:41,099 WARN L233 SmtUtils]: Spent 9.46s on a formula simplification that was a NOOP. DAG size: 4644 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:40:41,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:40:41,887 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 24056 treesize of output 23910 [2022-11-16 19:40:50,995 WARN L233 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 4646 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:40:52,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 19:40:52,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24350 treesize of output 23994 [2022-11-16 19:41:02,287 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 4654 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-16 19:46:14,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Maybe an infinite loop [2022-11-16 19:46:14,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [907509375] [2022-11-16 19:46:14,646 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-16 19:46:14,646 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 19:46:14,651 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 19:46:14,656 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 19:46:14,656 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 19:46:14,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2022-11-16 19:46:14,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-16 19:46:14,757 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-16 19:46:14,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-16 19:46:14,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 19:46:14,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 19:46:14,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-16 19:46:14,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,851 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 96 treesize of output 71 [2022-11-16 19:46:14,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,931 INFO L321 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2022-11-16 19:46:14,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 39 [2022-11-16 19:46:14,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,959 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 19:46:14,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 99 [2022-11-16 19:46:14,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:14,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-16 19:46:15,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,022 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:46:15,041 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 19:46:15,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 258 treesize of output 158 [2022-11-16 19:46:15,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2022-11-16 19:46:15,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2022-11-16 19:46:15,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-16 19:46:15,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:46:15,146 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:46:15,176 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-16 19:46:15,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 243 treesize of output 150 [2022-11-16 19:46:15,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2022-11-16 19:46:15,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,255 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 19:46:15,290 INFO L321 Elim1Store]: treesize reduction 66, result has 20.5 percent of original size [2022-11-16 19:46:15,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 338 treesize of output 183 [2022-11-16 19:46:15,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 84 [2022-11-16 19:46:15,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:15,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 21 [2022-11-16 19:46:15,983 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 19:46:24,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [907509375] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:24,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 19:46:24,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [17] total 35 [2022-11-16 19:46:24,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891098714] [2022-11-16 19:46:24,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:24,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 19:46:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:24,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 19:46:24,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2581, Unknown=74, NotChecked=784, Total=3782 [2022-11-16 19:46:24,433 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:26,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:26,536 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2022-11-16 19:46:26,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 19:46:26,539 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 19:46:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:26,539 INFO L225 Difference]: With dead ends: 138 [2022-11-16 19:46:26,540 INFO L226 Difference]: Without dead ends: 138 [2022-11-16 19:46:26,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=343, Invalid=2581, Unknown=74, NotChecked=784, Total=3782 [2022-11-16 19:46:26,541 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 73 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:26,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 287 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-16 19:46:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-16 19:46:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 100. [2022-11-16 19:46:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 99 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2022-11-16 19:46:26,545 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 20 [2022-11-16 19:46:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:26,545 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2022-11-16 19:46:26,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2022-11-16 19:46:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 19:46:26,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:26,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:26,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 19:46:26,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-16 19:46:26,753 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:46:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash 312922614, now seen corresponding path program 1 times [2022-11-16 19:46:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:26,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590715540] [2022-11-16 19:46:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:26,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:27,577 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-16 19:46:27,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:27,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590715540] [2022-11-16 19:46:27,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590715540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:27,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:46:27,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-16 19:46:27,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137169744] [2022-11-16 19:46:27,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:27,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 19:46:27,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:27,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 19:46:27,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:46:27,579 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:28,592 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2022-11-16 19:46:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 19:46:28,592 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 19:46:28,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:28,593 INFO L225 Difference]: With dead ends: 107 [2022-11-16 19:46:28,593 INFO L226 Difference]: Without dead ends: 107 [2022-11-16 19:46:28,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-11-16 19:46:28,594 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 88 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:28,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 453 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 19:46:28,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-16 19:46:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2022-11-16 19:46:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 99 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 118 transitions. [2022-11-16 19:46:28,598 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 118 transitions. Word has length 21 [2022-11-16 19:46:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:28,598 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 118 transitions. [2022-11-16 19:46:28,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 118 transitions. [2022-11-16 19:46:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 19:46:28,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:28,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:28,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 19:46:28,600 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:46:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:28,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1190316497, now seen corresponding path program 1 times [2022-11-16 19:46:28,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:28,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064830276] [2022-11-16 19:46:28,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:28,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:29,344 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-16 19:46:29,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:29,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064830276] [2022-11-16 19:46:29,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064830276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:29,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:46:29,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 19:46:29,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841985617] [2022-11-16 19:46:29,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:29,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 19:46:29,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:29,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 19:46:29,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:46:29,346 INFO L87 Difference]: Start difference. First operand 100 states and 118 transitions. Second operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:29,854 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2022-11-16 19:46:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 19:46:29,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 19:46:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:29,855 INFO L225 Difference]: With dead ends: 115 [2022-11-16 19:46:29,855 INFO L226 Difference]: Without dead ends: 115 [2022-11-16 19:46:29,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-11-16 19:46:29,856 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 78 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:29,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 454 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:46:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-16 19:46:29,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2022-11-16 19:46:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.5) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2022-11-16 19:46:29,860 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 22 [2022-11-16 19:46:29,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:29,861 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2022-11-16 19:46:29,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2022-11-16 19:46:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 19:46:29,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:29,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:29,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 19:46:29,862 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:46:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1754894050, now seen corresponding path program 1 times [2022-11-16 19:46:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:29,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124550300] [2022-11-16 19:46:29,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:30,558 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-16 19:46:30,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:30,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124550300] [2022-11-16 19:46:30,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124550300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:30,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:46:30,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-16 19:46:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333280155] [2022-11-16 19:46:30,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:30,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-16 19:46:30,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:30,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-16 19:46:30,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-16 19:46:30,560 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:31,095 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-11-16 19:46:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 19:46:31,096 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-16 19:46:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:31,096 INFO L225 Difference]: With dead ends: 116 [2022-11-16 19:46:31,096 INFO L226 Difference]: Without dead ends: 116 [2022-11-16 19:46:31,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-11-16 19:46:31,097 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 105 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:31,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 325 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 19:46:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-16 19:46:31,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2022-11-16 19:46:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.4938271604938271) internal successors, (121), 102 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:31,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-11-16 19:46:31,100 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 23 [2022-11-16 19:46:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:31,100 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-11-16 19:46:31,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:31,101 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-11-16 19:46:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 19:46:31,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:31,101 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:31,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 19:46:31,101 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:46:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1432859507, now seen corresponding path program 1 times [2022-11-16 19:46:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:31,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693903562] [2022-11-16 19:46:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:31,184 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-16 19:46:31,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:31,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693903562] [2022-11-16 19:46:31,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693903562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:31,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:46:31,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 19:46:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303369146] [2022-11-16 19:46:31,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:31,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 19:46:31,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 19:46:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 19:46:31,190 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:31,337 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2022-11-16 19:46:31,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:46:31,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 19:46:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:31,338 INFO L225 Difference]: With dead ends: 102 [2022-11-16 19:46:31,338 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 19:46:31,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-16 19:46:31,339 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:31,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 155 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 19:46:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 19:46:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-16 19:46:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2022-11-16 19:46:31,342 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 24 [2022-11-16 19:46:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:31,342 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2022-11-16 19:46:31,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2022-11-16 19:46:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 19:46:31,343 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:31,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:31,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-16 19:46:31,346 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:46:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1960165041, now seen corresponding path program 1 times [2022-11-16 19:46:31,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:31,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179876633] [2022-11-16 19:46:31,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:31,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:31,577 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-16 19:46:31,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:31,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179876633] [2022-11-16 19:46:31,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179876633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 19:46:31,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 19:46:31,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 19:46:31,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406589115] [2022-11-16 19:46:31,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 19:46:31,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 19:46:31,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 19:46:31,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 19:46:31,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:46:31,579 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 19:46:31,900 INFO L93 Difference]: Finished difference Result 180 states and 207 transitions. [2022-11-16 19:46:31,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 19:46:31,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 19:46:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 19:46:31,901 INFO L225 Difference]: With dead ends: 180 [2022-11-16 19:46:31,901 INFO L226 Difference]: Without dead ends: 180 [2022-11-16 19:46:31,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 19:46:31,902 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 206 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 19:46:31,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 159 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 19:46:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-16 19:46:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 109. [2022-11-16 19:46:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 108 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2022-11-16 19:46:31,906 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 24 [2022-11-16 19:46:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 19:46:31,906 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2022-11-16 19:46:31,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 19:46:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2022-11-16 19:46:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 19:46:31,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 19:46:31,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 19:46:31,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 19:46:31,907 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-16 19:46:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 19:46:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1960169664, now seen corresponding path program 1 times [2022-11-16 19:46:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 19:46:31,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254986971] [2022-11-16 19:46:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 19:46:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 19:46:32,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 19:46:32,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254986971] [2022-11-16 19:46:32,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254986971] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 19:46:32,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723850100] [2022-11-16 19:46:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 19:46:32,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 19:46:32,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 19:46:32,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 19:46:33,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e884ce75-2805-4ed3-a626-0788d8d349c0/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 19:46:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 19:46:33,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-16 19:46:33,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 19:46:33,188 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 19:46:33,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 19 treesize of output 18 [2022-11-16 19:46:33,243 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-16 19:46:33,281 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-16 19:46:33,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-11-16 19:46:33,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:33,353 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 39 treesize of output 30 [2022-11-16 19:46:33,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:33,814 INFO L321 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-11-16 19:46:33,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 65 [2022-11-16 19:46:33,840 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 33 treesize of output 33 [2022-11-16 19:46:33,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 19:46:33,982 INFO L321 Elim1Store]: treesize reduction 104, result has 14.0 percent of original size [2022-11-16 19:46:33,982 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 4 case distinctions, treesize of input 115 treesize of output 75 [2022-11-16 19:46:34,003 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 55 treesize of output 55 [2022-11-16 19:46:34,366 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 19:46:34,367 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 113 [2022-11-16 19:46:34,389 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 57 treesize of output 57 [2022-11-16 19:46:34,452 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 19:46:34,453 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 92 [2022-11-16 19:46:34,465 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 51 treesize of output 51 [2022-11-16 19:46:34,691 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 48 treesize of output 36