./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-properties/alternating_list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/alternating_list-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba --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 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 --- 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-b5237d8 [2022-11-22 02:38:54,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:38:54,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:38:54,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:38:54,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:38:54,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:38:54,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:38:54,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:38:54,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:38:54,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:38:54,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:38:54,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:38:54,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:38:54,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:38:54,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:38:54,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:38:54,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:38:54,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:38:54,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:38:54,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:38:54,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:38:54,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:38:54,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:38:54,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:38:54,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:38:54,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:38:54,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:38:54,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:38:54,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:38:54,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:38:54,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:38:54,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:38:54,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:38:54,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:38:54,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:38:54,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:38:54,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:38:54,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:38:54,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:38:54,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:38:54,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:38:54,253 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-22 02:38:54,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:38:54,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:38:54,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:38:54,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:38:54,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:38:54,315 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:38:54,315 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:38:54,316 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:38:54,316 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:38:54,316 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:38:54,318 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:38:54,318 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:38:54,318 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:38:54,319 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:38:54,319 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:38:54,319 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:38:54,320 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:38:54,320 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:38:54,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 02:38:54,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 02:38:54,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:38:54,322 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:38:54,322 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:38:54,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:38:54,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:38:54,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:38:54,323 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 02:38:54,324 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 02:38:54,324 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-22 02:38:54,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:38:54,325 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 02:38:54,325 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:38:54,325 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:38:54,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:38:54,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:38:54,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:38:54,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:38:54,327 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:38:54,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:38:54,328 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:38:54,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:38:54,328 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:38:54,328 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_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/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_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba 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 -> 941f3dd0e4566f414ae914eed10af26405f8e9f2f3d427c146090b07336d2fc2 [2022-11-22 02:38:54,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:38:54,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:38:54,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:38:54,705 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:38:54,705 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:38:54,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/list-properties/alternating_list-1.i [2022-11-22 02:38:57,951 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:38:58,308 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:38:58,314 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/sv-benchmarks/c/list-properties/alternating_list-1.i [2022-11-22 02:38:58,327 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/data/df88a063e/60c73388a28742cfb8140badf4b5a44b/FLAG32ace3604 [2022-11-22 02:38:58,353 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/data/df88a063e/60c73388a28742cfb8140badf4b5a44b [2022-11-22 02:38:58,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:38:58,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:38:58,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:38:58,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:38:58,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:38:58,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:38:58" (1/1) ... [2022-11-22 02:38:58,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9fe67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:58, skipping insertion in model container [2022-11-22 02:38:58,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:38:58" (1/1) ... [2022-11-22 02:38:58,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:38:58,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:38:58,971 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-11-22 02:38:58,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:38:58,993 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:38:59,067 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/sv-benchmarks/c/list-properties/alternating_list-1.i[23574,23587] [2022-11-22 02:38:59,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:38:59,113 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:38:59,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59 WrapperNode [2022-11-22 02:38:59,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:38:59,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:38:59,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:38:59,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:38:59,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,203 INFO L138 Inliner]: procedures = 124, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2022-11-22 02:38:59,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:38:59,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:38:59,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:38:59,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:38:59,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,266 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:38:59,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:38:59,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:38:59,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:38:59,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (1/1) ... [2022-11-22 02:38:59,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:38:59,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:38:59,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:38:59,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:38:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-22 02:38:59,376 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-22 02:38:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:38:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:38:59,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 02:38:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:38:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 02:38:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 02:38:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:38:59,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:38:59,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:38:59,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:38:59,500 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:38:59,504 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:38:59,551 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-22 02:38:59,892 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:38:59,986 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:38:59,999 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-22 02:39:00,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:39:00 BoogieIcfgContainer [2022-11-22 02:39:00,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:39:00,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:39:00,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:39:00,009 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:39:00,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:38:58" (1/3) ... [2022-11-22 02:39:00,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2423bc45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:39:00, skipping insertion in model container [2022-11-22 02:39:00,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:59" (2/3) ... [2022-11-22 02:39:00,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2423bc45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:39:00, skipping insertion in model container [2022-11-22 02:39:00,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:39:00" (3/3) ... [2022-11-22 02:39:00,023 INFO L112 eAbstractionObserver]: Analyzing ICFG alternating_list-1.i [2022-11-22 02:39:00,042 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:39:00,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-22 02:39:00,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:39:00,099 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;@6a38494f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:39:00,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-11-22 02:39:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 35 states have (on average 2.2) internal successors, (77), 66 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 02:39:00,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:00,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 02:39:00,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 167560794, now seen corresponding path program 1 times [2022-11-22 02:39:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:00,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151036867] [2022-11-22 02:39:00,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:00,430 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-22 02:39:00,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:00,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151036867] [2022-11-22 02:39:00,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151036867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:00,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:00,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:39:00,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22931070] [2022-11-22 02:39:00,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:00,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-22 02:39:00,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:00,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-22 02:39:00,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 02:39:00,483 INFO L87 Difference]: Start difference. First operand has 68 states, 35 states have (on average 2.2) internal successors, (77), 66 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-22 02:39:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:00,531 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-11-22 02:39:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-22 02:39:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-22 02:39:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:00,542 INFO L225 Difference]: With dead ends: 68 [2022-11-22 02:39:00,543 INFO L226 Difference]: Without dead ends: 63 [2022-11-22 02:39:00,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-22 02:39:00,549 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:00,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:39:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-22 02:39:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-22 02:39:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 62 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 02:39:00,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-11-22 02:39:00,592 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 5 [2022-11-22 02:39:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:00,593 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-11-22 02:39:00,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-22 02:39:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-11-22 02:39:00,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:39:00,594 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:00,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:39:00,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:39:00,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash 899381665, now seen corresponding path program 1 times [2022-11-22 02:39:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:00,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319168163] [2022-11-22 02:39:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:00,710 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-22 02:39:00,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:00,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319168163] [2022-11-22 02:39:00,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319168163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:00,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:00,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:39:00,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089067311] [2022-11-22 02:39:00,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:00,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:39:00,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:00,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:39:00,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:39:00,715 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:00,880 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-11-22 02:39:00,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:39:00,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 02:39:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:00,883 INFO L225 Difference]: With dead ends: 83 [2022-11-22 02:39:00,883 INFO L226 Difference]: Without dead ends: 83 [2022-11-22 02:39:00,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:00,885 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 111 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:00,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 41 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-22 02:39:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2022-11-22 02:39:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.853658536585366) internal successors, (76), 63 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-11-22 02:39:00,894 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 6 [2022-11-22 02:39:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:00,895 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-11-22 02:39:00,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-11-22 02:39:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:39:00,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:00,896 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:39:00,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:39:00,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:00,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:00,897 INFO L85 PathProgramCache]: Analyzing trace with hash 899381666, now seen corresponding path program 1 times [2022-11-22 02:39:00,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:00,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035087304] [2022-11-22 02:39:00,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:00,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:01,060 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-22 02:39:01,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:01,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035087304] [2022-11-22 02:39:01,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035087304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:01,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:01,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:39:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357689452] [2022-11-22 02:39:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:01,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:39:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:01,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:39:01,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:39:01,064 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:01,243 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2022-11-22 02:39:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:39:01,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 02:39:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:01,246 INFO L225 Difference]: With dead ends: 86 [2022-11-22 02:39:01,246 INFO L226 Difference]: Without dead ends: 86 [2022-11-22 02:39:01,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:01,255 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 119 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:01,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 52 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-22 02:39:01,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2022-11-22 02:39:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 77 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-22 02:39:01,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2022-11-22 02:39:01,263 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 6 [2022-11-22 02:39:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:01,264 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2022-11-22 02:39:01,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:01,264 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2022-11-22 02:39:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:39:01,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:01,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:01,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:39:01,266 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash 412646002, now seen corresponding path program 1 times [2022-11-22 02:39:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:01,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819923241] [2022-11-22 02:39:01,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:01,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:01,348 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-22 02:39:01,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:01,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819923241] [2022-11-22 02:39:01,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819923241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:01,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:01,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:01,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595883911] [2022-11-22 02:39:01,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:01,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:39:01,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:01,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:39:01,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:39:01,353 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-22 02:39:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:01,389 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-11-22 02:39:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:39:01,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-22 02:39:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:01,391 INFO L225 Difference]: With dead ends: 123 [2022-11-22 02:39:01,392 INFO L226 Difference]: Without dead ends: 123 [2022-11-22 02:39:01,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:39:01,393 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 46 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:01,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 106 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:39:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-22 02:39:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 86. [2022-11-22 02:39:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.619047619047619) internal successors, (102), 85 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-22 02:39:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2022-11-22 02:39:01,403 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 12 [2022-11-22 02:39:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:01,404 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2022-11-22 02:39:01,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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-22 02:39:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2022-11-22 02:39:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:39:01,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:01,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:01,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:39:01,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:01,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 412338172, now seen corresponding path program 1 times [2022-11-22 02:39:01,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:01,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704905420] [2022-11-22 02:39:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:01,579 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-22 02:39:01,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:01,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704905420] [2022-11-22 02:39:01,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704905420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:01,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:01,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:39:01,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898153978] [2022-11-22 02:39:01,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:01,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:39:01,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:01,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:39:01,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:01,583 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:01,760 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2022-11-22 02:39:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:39:01,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-22 02:39:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:01,764 INFO L225 Difference]: With dead ends: 106 [2022-11-22 02:39:01,765 INFO L226 Difference]: Without dead ends: 106 [2022-11-22 02:39:01,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:01,770 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 42 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:01,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 136 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:01,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-22 02:39:01,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-11-22 02:39:01,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.6) internal successors, (104), 87 states have internal predecessors, (104), 0 states have call successors, (0), 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-22 02:39:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2022-11-22 02:39:01,784 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 12 [2022-11-22 02:39:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:01,784 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2022-11-22 02:39:01,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2022-11-22 02:39:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 02:39:01,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:01,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:01,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:39:01,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:01,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:01,792 INFO L85 PathProgramCache]: Analyzing trace with hash -133788534, now seen corresponding path program 1 times [2022-11-22 02:39:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:01,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356736479] [2022-11-22 02:39:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:01,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:01,932 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-22 02:39:01,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:01,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356736479] [2022-11-22 02:39:01,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356736479] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:01,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:01,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:39:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432702973] [2022-11-22 02:39:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:01,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:39:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:01,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:39:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:39:01,935 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:02,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:02,029 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-11-22 02:39:02,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:39:02,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 02:39:02,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:02,032 INFO L225 Difference]: With dead ends: 92 [2022-11-22 02:39:02,032 INFO L226 Difference]: Without dead ends: 92 [2022-11-22 02:39:02,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:02,035 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 94 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:02,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 62 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-22 02:39:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2022-11-22 02:39:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 88 states have internal predecessors, (105), 0 states have call successors, (0), 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-22 02:39:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2022-11-22 02:39:02,042 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 13 [2022-11-22 02:39:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:02,042 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2022-11-22 02:39:02,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:02,043 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2022-11-22 02:39:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 02:39:02,043 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:02,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:02,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:39:02,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:02,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash -133785972, now seen corresponding path program 1 times [2022-11-22 02:39:02,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:02,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042732220] [2022-11-22 02:39:02,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:02,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:02,103 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-22 02:39:02,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:02,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042732220] [2022-11-22 02:39:02,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042732220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:02,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:02,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892584587] [2022-11-22 02:39:02,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:02,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:39:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:02,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:39:02,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:02,106 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:02,210 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2022-11-22 02:39:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:39:02,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 02:39:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:02,211 INFO L225 Difference]: With dead ends: 96 [2022-11-22 02:39:02,211 INFO L226 Difference]: Without dead ends: 96 [2022-11-22 02:39:02,211 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-22 02:39:02,217 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 112 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:02,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-22 02:39:02,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-22 02:39:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:02,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-11-22 02:39:02,239 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 13 [2022-11-22 02:39:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:02,239 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-11-22 02:39:02,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-11-22 02:39:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:39:02,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:02,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:02,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 02:39:02,242 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:02,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash 147602317, now seen corresponding path program 1 times [2022-11-22 02:39:02,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:02,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852853715] [2022-11-22 02:39:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:02,412 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-22 02:39:02,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:02,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852853715] [2022-11-22 02:39:02,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852853715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:02,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:02,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-22 02:39:02,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156990635] [2022-11-22 02:39:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:02,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:39:02,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:02,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:39:02,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:02,418 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:02,639 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2022-11-22 02:39:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:39:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 02:39:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:02,641 INFO L225 Difference]: With dead ends: 103 [2022-11-22 02:39:02,641 INFO L226 Difference]: Without dead ends: 103 [2022-11-22 02:39:02,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:39:02,642 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 47 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:02,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 212 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-22 02:39:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2022-11-22 02:39:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 92 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-22 02:39:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-11-22 02:39:02,648 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 14 [2022-11-22 02:39:02,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:02,648 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-11-22 02:39:02,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-11-22 02:39:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:39:02,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:02,650 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:02,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 02:39:02,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:02,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash -902756227, now seen corresponding path program 1 times [2022-11-22 02:39:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:02,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248883075] [2022-11-22 02:39:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:02,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:02,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:02,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248883075] [2022-11-22 02:39:02,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248883075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:02,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:02,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:39:02,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855718126] [2022-11-22 02:39:02,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:02,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:39:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:02,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:39:02,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:02,765 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:02,909 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-11-22 02:39:02,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:39:02,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 02:39:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:02,910 INFO L225 Difference]: With dead ends: 100 [2022-11-22 02:39:02,911 INFO L226 Difference]: Without dead ends: 100 [2022-11-22 02:39:02,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:39:02,912 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 78 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:02,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 88 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-22 02:39:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2022-11-22 02:39:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-11-22 02:39:02,917 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 14 [2022-11-22 02:39:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:02,918 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-11-22 02:39:02,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-22 02:39:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-11-22 02:39:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 02:39:02,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:02,919 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:02,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 02:39:02,920 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash -902756226, now seen corresponding path program 1 times [2022-11-22 02:39:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:02,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530125076] [2022-11-22 02:39:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:03,104 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:03,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530125076] [2022-11-22 02:39:03,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530125076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:03,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:03,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:39:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143339041] [2022-11-22 02:39:03,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:03,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:39:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:03,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:39:03,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:03,107 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:03,279 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2022-11-22 02:39:03,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:39:03,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 02:39:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:03,280 INFO L225 Difference]: With dead ends: 93 [2022-11-22 02:39:03,281 INFO L226 Difference]: Without dead ends: 93 [2022-11-22 02:39:03,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:39:03,282 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 55 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:03,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 114 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-22 02:39:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2022-11-22 02:39:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.453125) internal successors, (93), 78 states have internal predecessors, (93), 0 states have call successors, (0), 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-22 02:39:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2022-11-22 02:39:03,286 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 14 [2022-11-22 02:39:03,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:03,287 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2022-11-22 02:39:03,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-22 02:39:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2022-11-22 02:39:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:39:03,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:03,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:03,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 02:39:03,289 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:03,290 INFO L85 PathProgramCache]: Analyzing trace with hash 278242960, now seen corresponding path program 1 times [2022-11-22 02:39:03,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:03,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663948562] [2022-11-22 02:39:03,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:03,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:03,383 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-22 02:39:03,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:03,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663948562] [2022-11-22 02:39:03,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663948562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:03,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:03,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:03,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388114971] [2022-11-22 02:39:03,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:03,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:39:03,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:03,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:39:03,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:03,386 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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-22 02:39:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:03,505 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-11-22 02:39:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:39:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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-22 02:39:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:03,506 INFO L225 Difference]: With dead ends: 89 [2022-11-22 02:39:03,507 INFO L226 Difference]: Without dead ends: 79 [2022-11-22 02:39:03,507 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-22 02:39:03,528 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:03,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 121 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:03,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-22 02:39:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-11-22 02:39:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.459016393442623) internal successors, (89), 75 states have internal predecessors, (89), 0 states have call successors, (0), 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-22 02:39:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2022-11-22 02:39:03,546 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 15 [2022-11-22 02:39:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:03,547 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2022-11-22 02:39:03,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 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-22 02:39:03,547 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2022-11-22 02:39:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 02:39:03,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:03,548 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:03,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 02:39:03,549 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:03,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1411498456, now seen corresponding path program 1 times [2022-11-22 02:39:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:03,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931979768] [2022-11-22 02:39:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:03,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:03,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931979768] [2022-11-22 02:39:03,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931979768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:39:03,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476351279] [2022-11-22 02:39:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:03,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:03,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:03,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:39:03,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:39:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:04,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-22 02:39:04,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:04,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:39:04,411 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:39:04,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:39:04,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:04,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:39:04,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:04,586 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 20 treesize of output 8 [2022-11-22 02:39:04,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 02:39:04,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 02:39:04,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:04,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:39:05,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:05,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-22 02:39:05,085 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-22 02:39:05,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-11-22 02:39:05,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-22 02:39:05,114 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-22 02:39:05,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-22 02:39:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:05,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476351279] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:39:05,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1546457981] [2022-11-22 02:39:05,224 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-22 02:39:05,224 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:39:05,232 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:39:05,243 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:39:05,244 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:39:05,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:39:05,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:05,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:05,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,434 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 26 treesize of output 28 [2022-11-22 02:39:05,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:05,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:05,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:05,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:05,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:05,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:05,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:05,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:05,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:06,038 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:06,039 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 260 treesize of output 242 [2022-11-22 02:39:06,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:06,109 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:39:06,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:39:06,146 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:06,147 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 256 treesize of output 238 [2022-11-22 02:39:06,688 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:39:11,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1546457981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:11,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:39:11,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10, 9, 9] total 34 [2022-11-22 02:39:11,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876565233] [2022-11-22 02:39:11,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:11,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 02:39:11,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:11,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 02:39:11,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=886, Unknown=4, NotChecked=0, Total=1122 [2022-11-22 02:39:11,443 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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-22 02:39:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:12,550 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2022-11-22 02:39:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 02:39:12,551 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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 20 [2022-11-22 02:39:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:12,552 INFO L225 Difference]: With dead ends: 103 [2022-11-22 02:39:12,552 INFO L226 Difference]: Without dead ends: 103 [2022-11-22 02:39:12,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=252, Invalid=1004, Unknown=4, NotChecked=0, Total=1260 [2022-11-22 02:39:12,553 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 33 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:12,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 93 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-22 02:39:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-22 02:39:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2022-11-22 02:39:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 92 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-22 02:39:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-11-22 02:39:12,557 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 20 [2022-11-22 02:39:12,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:12,558 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-11-22 02:39:12,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 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-22 02:39:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-11-22 02:39:12,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-22 02:39:12,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:12,559 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:12,572 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 02:39:12,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:12,765 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:12,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:12,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2138902324, now seen corresponding path program 1 times [2022-11-22 02:39:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:12,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460483616] [2022-11-22 02:39:12,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:13,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:13,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460483616] [2022-11-22 02:39:13,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460483616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:39:13,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507114008] [2022-11-22 02:39:13,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:13,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:13,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:13,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:39:13,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 02:39:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:13,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-22 02:39:13,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:13,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:39:13,449 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:39:13,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:39:13,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:13,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:39:13,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:13,599 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 20 treesize of output 8 [2022-11-22 02:39:13,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 02:39:13,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 02:39:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:13,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:39:13,845 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int))) (< (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-22 02:39:14,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:14,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-22 02:39:14,033 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-22 02:39:14,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2022-11-22 02:39:14,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-22 02:39:14,055 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-22 02:39:14,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-22 02:39:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:14,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507114008] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:39:14,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [849138124] [2022-11-22 02:39:14,134 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-22 02:39:14,134 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:39:14,134 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:39:14,135 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:39:14,135 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:39:14,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:39:14,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:14,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,240 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 26 treesize of output 28 [2022-11-22 02:39:14,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:14,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:14,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:14,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:14,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:14,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:14,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:14,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:14,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:14,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:14,692 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:14,693 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 260 treesize of output 242 [2022-11-22 02:39:14,730 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:14,730 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 260 treesize of output 242 [2022-11-22 02:39:14,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:14,808 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:39:14,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:39:15,248 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:39:19,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [849138124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:19,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:39:19,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11, 9, 10] total 39 [2022-11-22 02:39:19,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974812196] [2022-11-22 02:39:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:19,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 02:39:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:19,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 02:39:19,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1192, Unknown=6, NotChecked=72, Total=1482 [2022-11-22 02:39:19,826 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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-22 02:39:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:20,614 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-11-22 02:39:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 02:39:20,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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 23 [2022-11-22 02:39:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:20,618 INFO L225 Difference]: With dead ends: 101 [2022-11-22 02:39:20,618 INFO L226 Difference]: Without dead ends: 94 [2022-11-22 02:39:20,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=222, Invalid=1258, Unknown=6, NotChecked=74, Total=1560 [2022-11-22 02:39:20,619 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:20,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 95 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 02:39:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-22 02:39:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-11-22 02:39:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 92 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2022-11-22 02:39:20,623 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 23 [2022-11-22 02:39:20,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:20,623 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2022-11-22 02:39:20,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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-22 02:39:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2022-11-22 02:39:20,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 02:39:20,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:20,624 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:20,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:20,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 02:39:20,843 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash 192746989, now seen corresponding path program 1 times [2022-11-22 02:39:20,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:20,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588766754] [2022-11-22 02:39:20,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:20,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-22 02:39:20,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:20,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588766754] [2022-11-22 02:39:20,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588766754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:20,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:20,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:39:20,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978783092] [2022-11-22 02:39:20,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:20,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:39:20,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:20,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:39:20,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:39:20,893 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-22 02:39:20,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:20,933 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2022-11-22 02:39:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:39:20,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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 24 [2022-11-22 02:39:20,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:20,935 INFO L225 Difference]: With dead ends: 91 [2022-11-22 02:39:20,935 INFO L226 Difference]: Without dead ends: 91 [2022-11-22 02:39:20,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:39:20,936 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:20,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:39:20,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-22 02:39:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-22 02:39:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 78 states have (on average 1.358974358974359) internal successors, (106), 90 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2022-11-22 02:39:20,940 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 24 [2022-11-22 02:39:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:20,941 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2022-11-22 02:39:20,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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-22 02:39:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2022-11-22 02:39:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-22 02:39:20,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:20,942 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:20,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 02:39:20,943 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:20,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:20,943 INFO L85 PathProgramCache]: Analyzing trace with hash 546263767, now seen corresponding path program 1 times [2022-11-22 02:39:20,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:20,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458169963] [2022-11-22 02:39:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:20,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:21,629 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:21,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458169963] [2022-11-22 02:39:21,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458169963] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:39:21,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041422260] [2022-11-22 02:39:21,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:21,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:21,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:21,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:39:21,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 02:39:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:21,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 02:39:21,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:21,845 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:39:21,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:39:21,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:21,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:21,962 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:39:21,962 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 52 treesize of output 49 [2022-11-22 02:39:21,967 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 34 treesize of output 36 [2022-11-22 02:39:21,970 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 23 treesize of output 15 [2022-11-22 02:39:22,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-22 02:39:22,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-22 02:39:22,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 02:39:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:22,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:39:22,103 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 79 treesize of output 57 [2022-11-22 02:39:22,183 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_264 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_264) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse0)) (forall ((v_ArrVal_263 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_263) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse2)))))) is different from false [2022-11-22 02:39:22,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:22,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-22 02:39:22,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:22,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-22 02:39:22,210 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 7 treesize of output 3 [2022-11-22 02:39:22,227 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-22 02:39:22,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-11-22 02:39:22,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:22,365 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 34 treesize of output 74 [2022-11-22 02:39:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:22,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041422260] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:39:22,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [858374533] [2022-11-22 02:39:22,523 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-22 02:39:22,523 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:39:22,524 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:39:22,524 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:39:22,524 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:39:22,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:39:22,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,601 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 26 treesize of output 28 [2022-11-22 02:39:22,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:22,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:22,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:22,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:22,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:22,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:22,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:22,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:22,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:22,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:22,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:23,011 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:23,012 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 260 treesize of output 242 [2022-11-22 02:39:23,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:23,085 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:39:23,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:39:23,122 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:23,122 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 256 treesize of output 238 [2022-11-22 02:39:23,962 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:39:27,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [858374533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:27,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:39:27,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11, 10, 10] total 32 [2022-11-22 02:39:27,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656499956] [2022-11-22 02:39:27,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:27,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-22 02:39:27,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:27,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-22 02:39:27,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=780, Unknown=3, NotChecked=60, Total=1056 [2022-11-22 02:39:27,507 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-22 02:39:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:28,162 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-11-22 02:39:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-22 02:39:28,162 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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 26 [2022-11-22 02:39:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:28,163 INFO L225 Difference]: With dead ends: 77 [2022-11-22 02:39:28,163 INFO L226 Difference]: Without dead ends: 77 [2022-11-22 02:39:28,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=228, Invalid=829, Unknown=3, NotChecked=62, Total=1122 [2022-11-22 02:39:28,164 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:28,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 53 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 02:39:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-22 02:39:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-11-22 02:39:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 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-22 02:39:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-22 02:39:28,167 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 26 [2022-11-22 02:39:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:28,167 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-22 02:39:28,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 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-22 02:39:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-22 02:39:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-22 02:39:28,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:28,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:28,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:28,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 02:39:28,369 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:28,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:28,370 INFO L85 PathProgramCache]: Analyzing trace with hash -294744398, now seen corresponding path program 1 times [2022-11-22 02:39:28,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:28,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622256289] [2022-11-22 02:39:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-22 02:39:28,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:28,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622256289] [2022-11-22 02:39:28,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622256289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:28,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:39:28,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:39:28,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342034898] [2022-11-22 02:39:28,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:28,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:39:28,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:28,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:39:28,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:39:28,441 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-22 02:39:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:28,521 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-11-22 02:39:28,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:39:28,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 28 [2022-11-22 02:39:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:28,522 INFO L225 Difference]: With dead ends: 80 [2022-11-22 02:39:28,522 INFO L226 Difference]: Without dead ends: 80 [2022-11-22 02:39:28,523 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-22 02:39:28,523 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 62 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:28,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 54 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:39:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-22 02:39:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2022-11-22 02:39:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.253968253968254) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 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-22 02:39:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-11-22 02:39:28,526 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2022-11-22 02:39:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:28,526 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-11-22 02:39:28,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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-22 02:39:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-11-22 02:39:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 02:39:28,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:28,528 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:28,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 02:39:28,528 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:28,528 INFO L85 PathProgramCache]: Analyzing trace with hash -549603317, now seen corresponding path program 1 times [2022-11-22 02:39:28,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:28,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251253514] [2022-11-22 02:39:28,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:28,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:39:28,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:28,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251253514] [2022-11-22 02:39:28,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251253514] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:39:28,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972758420] [2022-11-22 02:39:28,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:28,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:28,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:28,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:39:28,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 02:39:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:28,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-22 02:39:28,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:28,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:28,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-22 02:39:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:39:28,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:39:29,008 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-22 02:39:29,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2022-11-22 02:39:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:39:29,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972758420] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:39:29,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [946234754] [2022-11-22 02:39:29,040 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-22 02:39:29,040 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:39:29,041 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:39:29,041 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:39:29,041 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:39:29,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:39:29,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,128 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 26 treesize of output 28 [2022-11-22 02:39:29,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:29,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:29,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:29,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:29,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:29,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:29,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:29,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:29,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:29,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:29,445 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:29,446 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 260 treesize of output 242 [2022-11-22 02:39:29,469 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:29,514 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:39:29,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:39:29,550 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:29,551 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 256 treesize of output 238 [2022-11-22 02:39:29,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:39:30,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:30,079 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 26 treesize of output 28 [2022-11-22 02:39:30,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:30,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:30,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:30,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:30,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:30,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:30,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:30,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:30,142 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:39:34,573 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3679#(and (or (and (= |ULTIMATE.start_main_~flag~0#1| 1) (= |#NULL.base| 0)) (and (= |ULTIMATE.start_main_~t~0#1.offset| 0) (= |#NULL.base| 0))) (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~flag~0#1| 1) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (<= |#NULL.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 0) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~p~0#1.offset|) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2022-11-22 02:39:34,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:39:34,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:39:34,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-11-22 02:39:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290812773] [2022-11-22 02:39:34,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:39:34,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 02:39:34,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:34,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 02:39:34,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1102, Unknown=0, NotChecked=0, Total=1332 [2022-11-22 02:39:34,576 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 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-22 02:39:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:35,175 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-11-22 02:39:35,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-22 02:39:35,176 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 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 29 [2022-11-22 02:39:35,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:35,177 INFO L225 Difference]: With dead ends: 92 [2022-11-22 02:39:35,177 INFO L226 Difference]: Without dead ends: 92 [2022-11-22 02:39:35,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=394, Invalid=1768, Unknown=0, NotChecked=0, Total=2162 [2022-11-22 02:39:35,179 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 206 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:35,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 243 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:39:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-22 02:39:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2022-11-22 02:39:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 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-22 02:39:35,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-11-22 02:39:35,183 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 29 [2022-11-22 02:39:35,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:35,183 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-11-22 02:39:35,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 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-22 02:39:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-11-22 02:39:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-22 02:39:35,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:35,184 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:35,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:35,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:35,391 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:35,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash -547141591, now seen corresponding path program 1 times [2022-11-22 02:39:35,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:35,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742640937] [2022-11-22 02:39:35,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:35,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:39:35,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:35,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742640937] [2022-11-22 02:39:35,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742640937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:39:35,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991360388] [2022-11-22 02:39:35,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:35,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:35,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:35,528 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:39:35,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 02:39:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:35,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-22 02:39:35,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:39:35,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:39:35,754 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-22 02:39:35,754 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 12 treesize of output 11 [2022-11-22 02:39:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:39:35,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991360388] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:39:35,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1840005575] [2022-11-22 02:39:35,774 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-22 02:39:35,775 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:39:35,775 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:39:35,775 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:39:35,776 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:39:35,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:35,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:35,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:39:35,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:35,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:35,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:35,866 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 26 treesize of output 28 [2022-11-22 02:39:35,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:35,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:35,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:35,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:35,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:35,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:35,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:35,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:35,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:35,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:35,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:36,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:36,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:36,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:36,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:36,237 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:36,238 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 260 treesize of output 242 [2022-11-22 02:39:36,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:36,304 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:39:36,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:39:36,335 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:36,336 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 256 treesize of output 238 [2022-11-22 02:39:37,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:37,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:37,163 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 26 treesize of output 28 [2022-11-22 02:39:37,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:37,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:37,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:37,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:37,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:37,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:37,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:37,213 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:39:40,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1840005575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:39:40,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:39:40,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 5, 5] total 23 [2022-11-22 02:39:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432060283] [2022-11-22 02:39:40,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:39:40,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-22 02:39:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:40,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-22 02:39:40,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2022-11-22 02:39:40,668 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 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-22 02:39:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:41,680 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-11-22 02:39:41,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 02:39:41,680 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 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 29 [2022-11-22 02:39:41,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:41,681 INFO L225 Difference]: With dead ends: 77 [2022-11-22 02:39:41,681 INFO L226 Difference]: Without dead ends: 77 [2022-11-22 02:39:41,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2022-11-22 02:39:41,682 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 84 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:41,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 66 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-22 02:39:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-22 02:39:41,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-11-22 02:39:41,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.234375) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 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-22 02:39:41,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-11-22 02:39:41,688 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 29 [2022-11-22 02:39:41,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:41,689 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-11-22 02:39:41,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 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-22 02:39:41,689 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-11-22 02:39:41,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 02:39:41,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:41,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:41,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:41,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 02:39:41,897 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash 218480003, now seen corresponding path program 1 times [2022-11-22 02:39:41,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:41,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555745803] [2022-11-22 02:39:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:42,506 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:42,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555745803] [2022-11-22 02:39:42,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555745803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:39:42,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530025725] [2022-11-22 02:39:42,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:42,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:42,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:42,508 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:39:42,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 02:39:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:42,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-22 02:39:42,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:42,758 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:39:42,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-22 02:39:42,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:42,952 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:39:42,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-22 02:39:43,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:43,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-11-22 02:39:43,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-22 02:39:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:39:43,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:39:43,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:43,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-22 02:39:43,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:43,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-11-22 02:39:43,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-11-22 02:39:43,971 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:43,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-22 02:39:43,976 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:43,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:43,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:43,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-22 02:39:44,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:44,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-22 02:39:44,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:39:44,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530025725] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:39:44,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [848734826] [2022-11-22 02:39:44,567 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-22 02:39:44,568 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:39:44,568 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:39:44,568 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:39:44,568 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:39:44,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:39:44,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:44,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,632 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 26 treesize of output 28 [2022-11-22 02:39:44,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:44,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:44,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:44,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:44,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:44,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:44,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:44,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:44,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:44,912 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:44,913 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 260 treesize of output 242 [2022-11-22 02:39:44,941 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:44,941 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 260 treesize of output 242 [2022-11-22 02:39:44,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:44,999 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:39:44,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:39:45,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:39:45,472 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:39:45,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:39:45,616 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:39:45,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:39:45,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:45,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:45,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:45,792 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 26 treesize of output 28 [2022-11-22 02:39:45,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:45,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:45,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:45,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:45,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:45,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:45,834 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:39:50,448 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4438#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (not (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 02:39:50,448 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:39:50,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:39:50,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-11-22 02:39:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918724137] [2022-11-22 02:39:50,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:39:50,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-22 02:39:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:50,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-22 02:39:50,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2330, Unknown=4, NotChecked=0, Total=2756 [2022-11-22 02:39:50,451 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:39:51,681 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2022-11-22 02:39:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 02:39:51,681 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-22 02:39:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:39:51,682 INFO L225 Difference]: With dead ends: 139 [2022-11-22 02:39:51,682 INFO L226 Difference]: Without dead ends: 139 [2022-11-22 02:39:51,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1789 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=650, Invalid=3506, Unknown=4, NotChecked=0, Total=4160 [2022-11-22 02:39:51,685 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 293 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:39:51,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 344 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:39:51,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-22 02:39:51,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 97. [2022-11-22 02:39:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 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-22 02:39:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-11-22 02:39:51,691 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 30 [2022-11-22 02:39:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:39:51,691 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-11-22 02:39:51,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:39:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-11-22 02:39:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-22 02:39:51,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:39:51,693 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:39:51,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:39:51,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:51,895 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:39:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:39:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash 218480004, now seen corresponding path program 1 times [2022-11-22 02:39:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:39:51,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687717106] [2022-11-22 02:39:51,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:39:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:39:52,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:39:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687717106] [2022-11-22 02:39:52,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687717106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:39:52,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838673433] [2022-11-22 02:39:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:39:52,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:39:52,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:39:52,556 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:39:52,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:39:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:39:52,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-22 02:39:52,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:39:52,745 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:39:52,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:39:52,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:39:52,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:52,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:52,939 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:39:52,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-22 02:39:52,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-22 02:39:53,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-22 02:39:53,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 02:39:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:39:53,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:39:53,326 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_481) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_480 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-11-22 02:39:53,350 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_481) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_480 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_480) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-11-22 02:39:53,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:53,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-22 02:39:53,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:53,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-22 02:39:53,371 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 7 treesize of output 3 [2022-11-22 02:39:53,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:53,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-22 02:39:53,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:53,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-11-22 02:39:53,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:53,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-11-22 02:39:53,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:53,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-22 02:39:53,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:39:53,535 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 34 treesize of output 74 [2022-11-22 02:39:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-22 02:39:53,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838673433] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:39:53,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2078593458] [2022-11-22 02:39:53,746 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-22 02:39:53,746 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:39:53,746 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:39:53,746 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:39:53,747 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:39:53,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:39:53,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,813 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 26 treesize of output 28 [2022-11-22 02:39:53,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:53,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:53,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:53,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:53,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:53,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:53,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:53,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:53,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:39:53,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:39:54,140 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:54,141 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 260 treesize of output 242 [2022-11-22 02:39:54,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:39:54,226 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:39:54,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:39:54,267 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:39:54,267 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 256 treesize of output 238 [2022-11-22 02:39:55,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:39:55,119 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:39:55,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:39:55,230 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:39:55,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:39:55,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:55,358 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 26 treesize of output 28 [2022-11-22 02:39:55,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:55,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:39:55,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:55,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:55,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:55,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:55,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:39:55,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:39:55,416 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:39:59,452 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4918#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (or (not (<= 0 |ULTIMATE.start_main_~p~0#1.offset|)) (not (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 02:39:59,452 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:39:59,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:39:59,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2022-11-22 02:39:59,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196146543] [2022-11-22 02:39:59,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:39:59,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-22 02:39:59,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:39:59,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-22 02:39:59,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1500, Unknown=2, NotChecked=166, Total=1980 [2022-11-22 02:39:59,455 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:40:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:40:02,375 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2022-11-22 02:40:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-22 02:40:02,376 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-22 02:40:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:40:02,378 INFO L225 Difference]: With dead ends: 149 [2022-11-22 02:40:02,378 INFO L226 Difference]: Without dead ends: 149 [2022-11-22 02:40:02,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=692, Invalid=3346, Unknown=2, NotChecked=250, Total=4290 [2022-11-22 02:40:02,386 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 235 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:40:02,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 317 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 463 Invalid, 1 Unknown, 150 Unchecked, 0.5s Time] [2022-11-22 02:40:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-22 02:40:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 100. [2022-11-22 02:40:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:40:02,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2022-11-22 02:40:02,390 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 30 [2022-11-22 02:40:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:40:02,390 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2022-11-22 02:40:02,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:40:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-11-22 02:40:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-22 02:40:02,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:40:02,392 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:40:02,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:40:02,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-22 02:40:02,599 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:40:02,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:40:02,600 INFO L85 PathProgramCache]: Analyzing trace with hash 487758996, now seen corresponding path program 1 times [2022-11-22 02:40:02,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:40:02,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654303578] [2022-11-22 02:40:02,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:40:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:40:03,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:40:03,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654303578] [2022-11-22 02:40:03,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654303578] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:40:03,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178257091] [2022-11-22 02:40:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:03,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:40:03,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:40:03,176 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:40:03,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 02:40:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:03,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-22 02:40:03,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:40:03,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:40:03,465 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:40:03,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:40:03,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:03,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:03,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:40:03,615 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 20 treesize of output 8 [2022-11-22 02:40:03,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 02:40:03,725 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:40:03,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:40:03,791 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 13 treesize of output 9 [2022-11-22 02:40:03,800 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 14 treesize of output 16 [2022-11-22 02:40:03,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-22 02:40:03,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-22 02:40:03,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 02:40:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:40:03,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:40:04,081 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_566 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-11-22 02:40:04,330 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_23| Int) (v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_23|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_564) |v_ULTIMATE.start_main_~t~0#1.base_23| v_ArrVal_566) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3))) is different from false [2022-11-22 02:40:04,441 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-22 02:40:04,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-22 02:40:04,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:04,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-22 02:40:04,735 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-22 02:40:04,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 117 [2022-11-22 02:40:04,743 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 106 treesize of output 102 [2022-11-22 02:40:04,751 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 102 treesize of output 94 [2022-11-22 02:40:04,766 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-22 02:40:04,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-22 02:40:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-22 02:40:06,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178257091] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:40:06,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2005373131] [2022-11-22 02:40:06,452 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2022-11-22 02:40:06,452 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:40:06,452 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:40:06,452 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:40:06,453 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:40:06,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:40:06,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:06,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:06,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,540 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 26 treesize of output 28 [2022-11-22 02:40:06,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:40:06,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:40:06,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:06,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:06,730 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:40:06,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-22 02:40:06,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,750 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 34 treesize of output 16 [2022-11-22 02:40:06,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:06,769 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 33 treesize of output 38 [2022-11-22 02:40:06,934 INFO L321 Elim1Store]: treesize reduction 138, result has 17.9 percent of original size [2022-11-22 02:40:06,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 286 treesize of output 294 [2022-11-22 02:40:07,120 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-22 02:40:07,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 371 treesize of output 320 [2022-11-22 02:40:07,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:40:07,154 INFO L321 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-11-22 02:40:07,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 317 treesize of output 298 [2022-11-22 02:40:07,202 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-11-22 02:40:07,203 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 311 treesize of output 308 [2022-11-22 02:40:07,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,681 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:40:07,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 46 [2022-11-22 02:40:07,712 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:40:07,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-22 02:40:07,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,728 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 34 treesize of output 16 [2022-11-22 02:40:07,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:40:07,826 INFO L321 Elim1Store]: treesize reduction 94, result has 21.0 percent of original size [2022-11-22 02:40:07,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 245 treesize of output 149 [2022-11-22 02:40:07,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2022-11-22 02:40:07,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:07,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 78 [2022-11-22 02:40:07,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:40:07,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:40:07,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:40:07,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:07,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:08,074 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:40:08,075 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 34 treesize of output 16 [2022-11-22 02:40:08,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:08,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-11-22 02:40:08,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:40:08,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:40:08,162 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:40:08,162 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 34 treesize of output 16 [2022-11-22 02:40:08,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:08,174 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 34 treesize of output 16 [2022-11-22 02:40:08,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:40:08,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:40:08,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:08,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:08,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:40:08,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:08,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:08,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:40:08,479 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-22 02:40:08,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2022-11-22 02:40:08,565 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:40:11,230 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5444#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-11-22 02:40:11,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:40:11,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:40:11,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 37 [2022-11-22 02:40:11,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058780165] [2022-11-22 02:40:11,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:40:11,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-22 02:40:11,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:40:11,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-22 02:40:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2181, Unknown=26, NotChecked=194, Total=2652 [2022-11-22 02:40:11,233 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 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-22 02:40:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:40:14,657 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-11-22 02:40:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-22 02:40:14,657 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 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 31 [2022-11-22 02:40:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:40:14,658 INFO L225 Difference]: With dead ends: 95 [2022-11-22 02:40:14,658 INFO L226 Difference]: Without dead ends: 95 [2022-11-22 02:40:14,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=476, Invalid=3410, Unknown=28, NotChecked=246, Total=4160 [2022-11-22 02:40:14,660 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 138 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 58 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:40:14,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 407 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 604 Invalid, 6 Unknown, 97 Unchecked, 0.6s Time] [2022-11-22 02:40:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-22 02:40:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-11-22 02:40:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 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-22 02:40:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-22 02:40:14,662 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 31 [2022-11-22 02:40:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:40:14,663 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-22 02:40:14,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.2432432432432434) internal successors, (83), 37 states have internal predecessors, (83), 0 states have call successors, (0), 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-22 02:40:14,663 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-22 02:40:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 02:40:14,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:40:14,664 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:40:14,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:40:14,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-22 02:40:14,864 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:40:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:40:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1862398896, now seen corresponding path program 1 times [2022-11-22 02:40:14,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:40:14,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164909911] [2022-11-22 02:40:14,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:14,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:40:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:40:15,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:40:15,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164909911] [2022-11-22 02:40:15,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164909911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:40:15,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091460814] [2022-11-22 02:40:15,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:15,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:40:15,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:40:15,397 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:40:15,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 02:40:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:15,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-22 02:40:15,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:40:15,629 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:40:15,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:40:15,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:15,759 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:40:15,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-22 02:40:15,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-22 02:40:15,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:40:15,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:40:16,032 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_615 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) |c_#StackHeapBarrier|)) is different from false [2022-11-22 02:40:16,091 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:16,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-22 02:40:16,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:16,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-22 02:40:16,133 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 7 treesize of output 3 [2022-11-22 02:40:16,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:16,272 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 34 treesize of output 74 [2022-11-22 02:40:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-22 02:40:16,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091460814] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:40:16,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2066315245] [2022-11-22 02:40:16,480 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2022-11-22 02:40:16,481 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:40:16,481 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:40:16,481 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:40:16,481 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:40:16,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:40:16,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-22 02:40:16,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:16,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:16,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:40:16,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:16,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:40:16,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:16,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:16,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:40:16,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:16,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:16,879 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:40:16,880 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 260 treesize of output 242 [2022-11-22 02:40:16,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:40:16,965 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:40:16,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:40:17,006 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:40:17,006 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 256 treesize of output 238 [2022-11-22 02:40:17,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 02:40:17,776 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:40:17,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:40:17,898 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:40:17,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:40:18,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:18,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:18,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:18,055 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 26 treesize of output 28 [2022-11-22 02:40:18,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:18,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:18,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:18,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:18,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:18,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:40:18,087 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:40:22,554 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5881#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (not (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|)) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 02:40:22,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:40:22,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:40:22,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-11-22 02:40:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636719711] [2022-11-22 02:40:22,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:40:22,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-22 02:40:22,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:40:22,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-22 02:40:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1438, Unknown=2, NotChecked=80, Total=1806 [2022-11-22 02:40:22,559 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 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-22 02:40:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:40:23,311 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-11-22 02:40:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-22 02:40:23,314 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 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 33 [2022-11-22 02:40:23,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:40:23,315 INFO L225 Difference]: With dead ends: 129 [2022-11-22 02:40:23,315 INFO L226 Difference]: Without dead ends: 129 [2022-11-22 02:40:23,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=434, Invalid=2118, Unknown=2, NotChecked=98, Total=2652 [2022-11-22 02:40:23,317 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 230 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 02:40:23,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 249 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 381 Invalid, 0 Unknown, 108 Unchecked, 0.4s Time] [2022-11-22 02:40:23,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-22 02:40:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 85. [2022-11-22 02:40:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 84 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-22 02:40:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2022-11-22 02:40:23,321 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 33 [2022-11-22 02:40:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:40:23,321 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2022-11-22 02:40:23,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 23 states have internal predecessors, (73), 0 states have call successors, (0), 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-22 02:40:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2022-11-22 02:40:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-22 02:40:23,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:40:23,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:40:23,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-22 02:40:23,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:40:23,530 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:40:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:40:23,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1862401458, now seen corresponding path program 1 times [2022-11-22 02:40:23,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:40:23,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467740499] [2022-11-22 02:40:23,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:40:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:40:24,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:40:24,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467740499] [2022-11-22 02:40:24,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467740499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:40:24,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774048010] [2022-11-22 02:40:24,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:24,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:40:24,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:40:24,155 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:40:24,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 02:40:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:24,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-22 02:40:24,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:40:24,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:40:24,415 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:40:24,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:40:24,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:24,614 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:40:24,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-22 02:40:24,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-22 02:40:24,855 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 13 treesize of output 9 [2022-11-22 02:40:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:40:24,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:40:25,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:25,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-11-22 02:40:25,126 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:25,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-11-22 02:40:25,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-22 02:40:25,244 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 18 treesize of output 16 [2022-11-22 02:40:25,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:25,343 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 34 treesize of output 74 [2022-11-22 02:40:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:40:25,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774048010] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:40:25,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [116891072] [2022-11-22 02:40:25,454 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-22 02:40:25,454 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:40:25,455 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:40:25,455 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:40:25,455 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:40:25,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:40:25,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,524 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 26 treesize of output 28 [2022-11-22 02:40:25,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:25,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:25,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:40:25,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:25,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:40:25,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:25,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:25,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:25,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:40:25,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:25,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:40:25,863 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:40:25,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:40:25,904 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:40:25,905 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 256 treesize of output 238 [2022-11-22 02:40:25,943 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:40:25,943 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 256 treesize of output 238 [2022-11-22 02:40:26,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 02:40:26,596 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:40:26,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:40:26,709 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:40:26,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:40:26,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:26,814 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 26 treesize of output 28 [2022-11-22 02:40:26,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:26,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:26,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:26,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:26,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:26,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:26,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:26,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:40:26,866 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:40:31,334 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6359#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (exists ((|v_ULTIMATE.start_main_~p~0#1.offset_178| Int) (|v_ULTIMATE.start_main_~p~0#1.base_198| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_198|) 1) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_178|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_198|)) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_178|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_198|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_178|)) |ULTIMATE.start_main_~p~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_198|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_178|)) |ULTIMATE.start_main_~p~0#1.base|))) (<= 0 |ULTIMATE.start_main_~tmp~0#1.offset|) (= |#NULL.offset| 0) (not (= |ULTIMATE.start_main_~tmp~0#1.offset| 0)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 02:40:31,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:40:31,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:40:31,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2022-11-22 02:40:31,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483724952] [2022-11-22 02:40:31,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:40:31,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 02:40:31,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:40:31,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 02:40:31,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=2145, Unknown=4, NotChecked=0, Total=2550 [2022-11-22 02:40:31,337 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 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-22 02:40:32,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:40:32,622 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2022-11-22 02:40:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-22 02:40:32,623 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 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) Word has length 33 [2022-11-22 02:40:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:40:32,624 INFO L225 Difference]: With dead ends: 130 [2022-11-22 02:40:32,624 INFO L226 Difference]: Without dead ends: 130 [2022-11-22 02:40:32,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=722, Invalid=3830, Unknown=4, NotChecked=0, Total=4556 [2022-11-22 02:40:32,626 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 437 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:40:32,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 393 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:40:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-22 02:40:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 86. [2022-11-22 02:40:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:40:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-11-22 02:40:32,630 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 33 [2022-11-22 02:40:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:40:32,630 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-11-22 02:40:32,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 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-22 02:40:32,630 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-11-22 02:40:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-22 02:40:32,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:40:32,636 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:40:32,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:40:32,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-22 02:40:32,844 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:40:32,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:40:32,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1899870503, now seen corresponding path program 1 times [2022-11-22 02:40:32,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:40:32,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077571713] [2022-11-22 02:40:32,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:32,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:40:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:40:33,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:40:33,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077571713] [2022-11-22 02:40:33,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077571713] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:40:33,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843311990] [2022-11-22 02:40:33,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:33,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:40:33,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:40:33,604 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:40:33,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 02:40:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:33,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-22 02:40:33,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:40:33,840 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:40:33,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:40:33,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:34,050 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:40:34,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-22 02:40:34,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-22 02:40:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:40:34,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:40:34,725 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:34,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-22 02:40:34,736 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:34,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-22 02:40:34,742 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 7 treesize of output 3 [2022-11-22 02:40:34,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:34,955 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 34 treesize of output 74 [2022-11-22 02:40:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:40:35,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843311990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:40:35,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [212173430] [2022-11-22 02:40:35,180 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2022-11-22 02:40:35,180 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:40:35,180 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:40:35,181 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:40:35,181 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:40:35,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:40:35,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,282 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 26 treesize of output 28 [2022-11-22 02:40:35,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:35,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:35,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:40:35,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:35,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:35,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:40:35,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:35,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:40:35,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:35,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:35,551 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:40:35,551 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 260 treesize of output 242 [2022-11-22 02:40:35,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:40:35,616 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:40:35,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:40:35,649 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:40:35,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 238 [2022-11-22 02:40:35,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:40:36,034 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:40:36,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:40:36,172 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:40:36,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:40:36,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:36,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:40:36,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:36,311 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 26 treesize of output 28 [2022-11-22 02:40:36,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:36,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:36,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:36,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:36,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:40:36,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:40:36,346 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:40:41,572 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6860#(and (or (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~flag~0#1| 1) (= |#NULL.base| 0)) (and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~t~0#1.offset| 0) (= |#NULL.base| 0))) (not (< |ULTIMATE.start_main_~tmp~0#1.base| |#StackHeapBarrier|)) (<= |ULTIMATE.start_main_~flag~0#1| 1) (= |ULTIMATE.start_main_~tmp~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (<= |#NULL.offset| 0) (exists ((|v_ULTIMATE.start_main_~p~0#1.base_217| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_194| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~p~0#1.base_217|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_194|)) |ULTIMATE.start_main_~p~0#1.offset|) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_194|) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_217|) 1) (<= (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_194|) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_217|)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~p~0#1.base_217|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_194|)) |ULTIMATE.start_main_~p~0#1.base|))) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-22 02:40:41,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:40:41,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:40:41,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 34 [2022-11-22 02:40:41,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297948544] [2022-11-22 02:40:41,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:40:41,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 02:40:41,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:40:41,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 02:40:41,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=2384, Unknown=1, NotChecked=0, Total=2756 [2022-11-22 02:40:41,575 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 34 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-22 02:40:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:40:42,979 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-11-22 02:40:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 02:40:42,980 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 34 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) Word has length 34 [2022-11-22 02:40:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:40:42,981 INFO L225 Difference]: With dead ends: 107 [2022-11-22 02:40:42,981 INFO L226 Difference]: Without dead ends: 107 [2022-11-22 02:40:42,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=610, Invalid=3945, Unknown=1, NotChecked=0, Total=4556 [2022-11-22 02:40:42,983 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 320 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:40:42,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 368 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-22 02:40:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-22 02:40:42,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2022-11-22 02:40:42,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 83 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-22 02:40:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-11-22 02:40:42,987 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 34 [2022-11-22 02:40:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:40:42,988 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-11-22 02:40:42,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 34 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-22 02:40:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-11-22 02:40:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-22 02:40:42,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:40:42,989 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:40:42,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-22 02:40:43,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:40:43,196 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:40:43,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:40:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1236018122, now seen corresponding path program 1 times [2022-11-22 02:40:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:40:43,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040199577] [2022-11-22 02:40:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:40:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:40:44,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:40:44,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040199577] [2022-11-22 02:40:44,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040199577] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:40:44,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651890909] [2022-11-22 02:40:44,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:40:44,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:40:44,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:40:44,051 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:40:44,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 02:40:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:40:44,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 02:40:44,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:40:44,382 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-22 02:40:44,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 44 [2022-11-22 02:40:44,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:40:44,682 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:40:44,683 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 49 treesize of output 46 [2022-11-22 02:40:45,032 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 46 treesize of output 26 [2022-11-22 02:40:45,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2022-11-22 02:40:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-22 02:40:45,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:40:45,484 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-22 02:40:45,496 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_767 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_767) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0))) is different from false [2022-11-22 02:40:45,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:45,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-22 02:40:45,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:40:45,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-11-22 02:40:45,532 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 21 treesize of output 17 [2022-11-22 02:41:20,004 WARN L233 SmtUtils]: Spent 24.13s on a formula simplification. DAG size of input: 42 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:41:44,244 WARN L233 SmtUtils]: Spent 24.09s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:42:16,546 WARN L233 SmtUtils]: Spent 32.13s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:42:24,828 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:42:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-11-22 02:42:24,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651890909] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:42:24,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1920669623] [2022-11-22 02:42:24,867 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2022-11-22 02:42:24,868 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:42:24,868 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:42:24,868 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:42:24,868 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:42:24,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:24,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:24,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:42:24,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:42:24,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:42:24,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:24,944 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 26 treesize of output 28 [2022-11-22 02:42:24,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:24,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:24,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:24,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:24,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:24,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:42:24,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:25,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:25,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:25,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:42:25,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:25,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:25,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:25,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:25,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:42:25,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:25,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:42:25,235 INFO L321 Elim1Store]: treesize reduction 76, result has 25.5 percent of original size [2022-11-22 02:42:25,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 256 treesize of output 257 [2022-11-22 02:42:25,271 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:42:25,271 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 256 treesize of output 238 [2022-11-22 02:42:25,304 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:42:25,304 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 256 treesize of output 238 [2022-11-22 02:42:25,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 02:42:25,717 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:42:25,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:42:25,851 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:42:25,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:42:25,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:42:25,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:25,994 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 26 treesize of output 28 [2022-11-22 02:42:26,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:42:26,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:42:26,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:26,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:26,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:26,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:26,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:26,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:42:26,041 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:42:31,299 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7340#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< |ULTIMATE.start_main_~p~0#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~flag~0#1| 1) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_#res#1| 0) (= |#NULL.base| 0))' at error location [2022-11-22 02:42:31,299 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:42:31,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:42:31,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2022-11-22 02:42:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912473849] [2022-11-22 02:42:31,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:42:31,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-22 02:42:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-22 02:42:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2980, Unknown=8, NotChecked=226, Total=3540 [2022-11-22 02:42:31,301 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 37 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 36 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-22 02:42:32,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:42:32,823 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-11-22 02:42:32,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 02:42:32,823 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 36 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) Word has length 35 [2022-11-22 02:42:32,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:42:32,824 INFO L225 Difference]: With dead ends: 93 [2022-11-22 02:42:32,824 INFO L226 Difference]: Without dead ends: 71 [2022-11-22 02:42:32,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 105.8s TimeCoverageRelationStatistics Valid=417, Invalid=3743, Unknown=8, NotChecked=254, Total=4422 [2022-11-22 02:42:32,826 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 76 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-22 02:42:32,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 358 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 607 Invalid, 0 Unknown, 96 Unchecked, 0.8s Time] [2022-11-22 02:42:32,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-22 02:42:32,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2022-11-22 02:42:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 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-22 02:42:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2022-11-22 02:42:32,828 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 35 [2022-11-22 02:42:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:42:32,829 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2022-11-22 02:42:32,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 36 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-22 02:42:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-11-22 02:42:32,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-22 02:42:32,830 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:42:32,830 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:42:32,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 02:42:33,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-22 02:42:33,036 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:42:33,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:42:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash -403151837, now seen corresponding path program 1 times [2022-11-22 02:42:33,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:42:33,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201013460] [2022-11-22 02:42:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:33,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:42:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:42:33,824 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:42:33,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201013460] [2022-11-22 02:42:33,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201013460] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:42:33,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901099853] [2022-11-22 02:42:33,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:42:33,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:42:33,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:42:33,826 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:42:33,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 02:42:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:42:33,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-22 02:42:33,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:42:34,047 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:42:34,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-22 02:42:34,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:34,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:34,315 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:42:34,316 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 31 treesize of output 29 [2022-11-22 02:42:34,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:42:34,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:34,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-22 02:42:34,414 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-22 02:42:34,414 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 20 treesize of output 22 [2022-11-22 02:42:34,520 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:42:34,520 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 21 treesize of output 25 [2022-11-22 02:42:34,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:42:34,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:42:34,547 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-22 02:42:34,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2022-11-22 02:42:34,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-22 02:42:34,770 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-22 02:42:34,771 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 116 treesize of output 99 [2022-11-22 02:42:34,784 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:42:34,784 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 110 treesize of output 103 [2022-11-22 02:42:34,790 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 36 treesize of output 38 [2022-11-22 02:42:34,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:42:34,951 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:42:34,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2022-11-22 02:42:34,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-11-22 02:42:34,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-22 02:42:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 02:42:35,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:42:35,122 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (not (= 3 (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_858) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_860) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-11-22 02:42:35,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (v_ArrVal_860 (Array Int Int))) (not (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_858) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_860) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_859) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 3))) is different from false [2022-11-22 02:42:35,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:42:35,345 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 53 treesize of output 57 [2022-11-22 02:42:35,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:42:35,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 66 [2022-11-22 02:42:35,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:42:35,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 124 [2022-11-22 02:42:35,378 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 76 treesize of output 58 [2022-11-22 02:42:35,428 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 30 treesize of output 22 [2022-11-22 02:42:35,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:42:35,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 109 [2022-11-22 02:42:35,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:42:35,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 99 [2022-11-22 02:42:35,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:42:35,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 146 [2022-11-22 02:42:35,854 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 126 treesize of output 118 [2022-11-22 02:42:35,860 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 118 treesize of output 114 [2022-11-22 02:42:35,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:42:35,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 246 [2022-11-22 02:42:35,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 222 [2022-11-22 02:42:35,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 214 [2022-11-22 02:42:35,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:42:35,936 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 214 treesize of output 199 [2022-11-22 02:42:35,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:42:35,954 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 190 treesize of output 159 [2022-11-22 02:42:37,178 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:42:37,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 255 [2022-11-22 02:42:38,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-11-22 02:42:38,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901099853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:42:38,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2009497131] [2022-11-22 02:42:38,843 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-22 02:42:38,844 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:42:38,844 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:42:38,844 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:42:38,844 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:42:38,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:38,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:38,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:42:38,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:42:38,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:42:38,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:38,916 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 26 treesize of output 28 [2022-11-22 02:42:38,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:38,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:38,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:38,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:38,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:38,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:42:38,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:38,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:38,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-22 02:42:38,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:38,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:39,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:39,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:39,063 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 02:42:39,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 46 [2022-11-22 02:42:39,091 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:42:39,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-11-22 02:42:39,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:39,102 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 34 treesize of output 16 [2022-11-22 02:42:39,214 INFO L321 Elim1Store]: treesize reduction 142, result has 15.5 percent of original size [2022-11-22 02:42:39,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 351 treesize of output 351 [2022-11-22 02:42:39,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:39,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:39,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:42:39,506 INFO L321 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-22 02:42:39,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 129 [2022-11-22 02:42:39,554 INFO L321 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2022-11-22 02:42:39,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 117 [2022-11-22 02:42:39,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:42:39,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:39,679 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 34 treesize of output 16 [2022-11-22 02:42:39,701 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:42:39,701 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 34 treesize of output 16 [2022-11-22 02:42:39,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:42:39,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:42:39,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:42:39,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:42:39,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:39,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:39,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:39,806 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 34 treesize of output 16 [2022-11-22 02:42:39,827 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:42:39,828 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 34 treesize of output 16 [2022-11-22 02:42:39,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:42:39,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:39,854 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 34 treesize of output 16 [2022-11-22 02:42:39,875 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:42:39,876 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 34 treesize of output 16 [2022-11-22 02:42:39,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:42:39,959 INFO L321 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2022-11-22 02:42:39,960 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 6 case distinctions, treesize of input 180 treesize of output 194 [2022-11-22 02:42:40,060 INFO L321 Elim1Store]: treesize reduction 62, result has 41.5 percent of original size [2022-11-22 02:42:40,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 181 treesize of output 213 [2022-11-22 02:42:40,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:40,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:42:40,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:42:40,396 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-22 02:42:40,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 163 [2022-11-22 02:42:40,440 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-22 02:42:40,441 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 159 treesize of output 151 [2022-11-22 02:42:40,490 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-22 02:42:40,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 149 [2022-11-22 02:42:41,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-22 02:42:41,606 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:42:41,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:42:41,727 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-11-22 02:42:41,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2022-11-22 02:42:41,857 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-22 02:42:41,857 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 182 treesize of output 174 [2022-11-22 02:42:41,898 INFO L321 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-11-22 02:42:41,899 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 170 treesize of output 162 [2022-11-22 02:42:41,945 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-22 02:42:41,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 154 treesize of output 160 [2022-11-22 02:42:42,108 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-22 02:42:42,108 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 34 treesize of output 16 [2022-11-22 02:42:42,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:42:42,119 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 34 treesize of output 16 [2022-11-22 02:42:42,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:42:42,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:42:42,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-22 02:42:42,165 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:42:45,988 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7799#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_main_~flag~0#1| 1) (<= 0 |ULTIMATE.start_main_~flag~0#1|) (not (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 02:42:45,988 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:42:45,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:42:45,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2022-11-22 02:42:45,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815695452] [2022-11-22 02:42:45,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:42:45,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-22 02:42:45,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:42:45,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-22 02:42:45,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3226, Unknown=5, NotChecked=234, Total=3782 [2022-11-22 02:42:45,991 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 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-22 02:42:56,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 02:43:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:43:01,054 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-11-22 02:43:01,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-22 02:43:01,055 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 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 38 [2022-11-22 02:43:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:43:01,055 INFO L225 Difference]: With dead ends: 120 [2022-11-22 02:43:01,056 INFO L226 Difference]: Without dead ends: 102 [2022-11-22 02:43:01,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 91 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2527 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=828, Invalid=7346, Unknown=24, NotChecked=358, Total=8556 [2022-11-22 02:43:01,058 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 201 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 121 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:43:01,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 645 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1139 Invalid, 31 Unknown, 184 Unchecked, 4.6s Time] [2022-11-22 02:43:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-22 02:43:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2022-11-22 02:43:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 79 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-22 02:43:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-22 02:43:01,061 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 38 [2022-11-22 02:43:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:43:01,062 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-22 02:43:01,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 41 states have internal predecessors, (104), 0 states have call successors, (0), 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-22 02:43:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-22 02:43:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-22 02:43:01,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:43:01,063 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:43:01,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 02:43:01,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-22 02:43:01,272 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-11-22 02:43:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:43:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1434091777, now seen corresponding path program 2 times [2022-11-22 02:43:01,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:43:01,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807599691] [2022-11-22 02:43:01,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:43:01,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:43:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:43:02,786 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:02,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:43:02,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807599691] [2022-11-22 02:43:02,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807599691] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:43:02,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722716204] [2022-11-22 02:43:02,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:43:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:43:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:43:02,788 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:43:02,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_285640b4-aed1-48b3-8ffe-f881da7cc81c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 02:43:02,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-22 02:43:02,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:43:02,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-22 02:43:02,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:43:03,055 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:43:03,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:43:03,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:43:03,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:43:03,222 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:43:03,222 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 14 treesize of output 20 [2022-11-22 02:43:03,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-22 02:43:03,246 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:43:03,246 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 22 treesize of output 22 [2022-11-22 02:43:03,311 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:43:03,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:43:03,393 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:43:03,394 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 14 treesize of output 20 [2022-11-22 02:43:03,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-22 02:43:03,422 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-22 02:43:03,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2022-11-22 02:43:03,648 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:43:03,648 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 14 treesize of output 20 [2022-11-22 02:43:03,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-22 02:43:03,680 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-22 02:43:03,680 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 53 [2022-11-22 02:43:03,690 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 16 treesize of output 8 [2022-11-22 02:43:03,806 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-22 02:43:03,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-22 02:43:03,955 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-22 02:43:03,955 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 21 treesize of output 20 [2022-11-22 02:43:04,002 INFO L321 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2022-11-22 02:43:04,003 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 62 [2022-11-22 02:43:04,412 INFO L321 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2022-11-22 02:43:04,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 155 [2022-11-22 02:43:04,473 INFO L321 Elim1Store]: treesize reduction 74, result has 43.9 percent of original size [2022-11-22 02:43:04,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 153 [2022-11-22 02:43:04,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:43:04,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-22 02:43:04,681 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 18 treesize of output 10 [2022-11-22 02:43:05,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:05,261 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 359 treesize of output 381 [2022-11-22 02:43:05,460 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 19 treesize of output 11 [2022-11-22 02:43:05,494 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 19 treesize of output 11 [2022-11-22 02:43:05,524 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 19 treesize of output 11 [2022-11-22 02:43:06,676 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 62 treesize of output 50 [2022-11-22 02:43:06,699 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 77 treesize of output 63 [2022-11-22 02:43:06,749 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 62 treesize of output 50 [2022-11-22 02:43:06,772 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 81 treesize of output 69 [2022-11-22 02:43:07,406 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 63 treesize of output 51 [2022-11-22 02:43:07,457 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 133 treesize of output 113 [2022-11-22 02:43:12,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:43:12,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:12,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 173 treesize of output 167 [2022-11-22 02:43:13,389 INFO L321 Elim1Store]: treesize reduction 4, result has 97.1 percent of original size [2022-11-22 02:43:13,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 136 treesize of output 212 [2022-11-22 02:43:15,984 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-22 02:43:15,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-11-22 02:43:16,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-22 02:43:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:43:16,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:43:16,617 INFO L321 Elim1Store]: treesize reduction 4, result has 86.2 percent of original size [2022-11-22 02:43:16,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 95 [2022-11-22 02:43:17,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:17,667 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 21 treesize of output 25 [2022-11-22 02:43:17,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:17,675 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 24 treesize of output 28 [2022-11-22 02:43:17,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:17,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2022-11-22 02:43:17,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:17,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-22 02:43:17,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:17,720 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 24 treesize of output 28 [2022-11-22 02:43:18,858 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:43:18,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 310 treesize of output 494 [2022-11-22 02:43:19,283 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 50 treesize of output 42 [2022-11-22 02:43:19,314 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 57 treesize of output 45 [2022-11-22 02:43:19,373 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 41 treesize of output 33 [2022-11-22 02:43:19,505 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 7 treesize of output 3 [2022-11-22 02:43:19,673 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 46 treesize of output 38 [2022-11-22 02:43:19,712 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 46 treesize of output 38 [2022-11-22 02:43:20,247 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 19 treesize of output 11 [2022-11-22 02:43:20,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:43:20,395 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 28 treesize of output 20 [2022-11-22 02:43:20,590 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 35 treesize of output 23 [2022-11-22 02:43:20,827 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 45 treesize of output 37 [2022-11-22 02:43:20,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2022-11-22 02:43:20,975 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 45 treesize of output 37 [2022-11-22 02:43:21,079 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 291 treesize of output 275 [2022-11-22 02:43:22,139 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 30 treesize of output 18 [2022-11-22 02:43:22,178 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 63 treesize of output 47 [2022-11-22 02:43:22,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2022-11-22 02:43:22,499 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 57 treesize of output 45 [2022-11-22 02:43:22,512 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 45 treesize of output 37 [2022-11-22 02:43:22,588 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 19 treesize of output 11 [2022-11-22 02:43:22,727 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-22 02:43:22,814 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 46 treesize of output 38 [2022-11-22 02:43:23,359 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 23 treesize of output 15 [2022-11-22 02:43:23,549 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 208 treesize of output 196 [2022-11-22 02:43:23,740 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 215 treesize of output 199 [2022-11-22 02:43:23,933 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 182 treesize of output 170 [2022-11-22 02:43:31,058 WARN L859 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_main_~a~0#1.offset| 0) (let ((.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse15 (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse187 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse187) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse188 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse188 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse187 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse190 (+ 4 v_subst_2))) (let ((.cse189 (select v_arrayElimArr_19 .cse190))) (or (not (= (select (select (store (store .cse188 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse189 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse187 .cse189) (not (= (select v_arrayElimArr_20 .cse190) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse189 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse189)))))))))))) (.cse55 (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse183 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse184 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse182 (select (select (store (store .cse184 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse183 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse182) (= .cse183 .cse182) (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse186 (+ 4 v_subst_2))) (let ((.cse185 (select v_arrayElimArr_19 .cse186))) (or (not (= (select (select (store (store .cse184 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse185 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= .cse183 .cse185) (not (= (select v_arrayElimArr_20 .cse186) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse185 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse185))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse183))))) (.cse16 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))) (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse0 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse0) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse0 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse3 (+ 4 v_subst_1))) (let ((.cse4 (select v_arrayElimArr_22 .cse3))) (or (not (= (select v_arrayElimArr_23 .cse3) 0)) (not (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse4 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse4 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse4) (= .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse10 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse9 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse10 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse6 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse6) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_22 .cse6))) (or (not (= (select (select (store (store .cse7 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse8 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse8 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse8) (= .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse8 .cse9))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse9))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse10)))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse14 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse13 (+ v_prenex_492 4))) (let ((.cse12 (select v_prenex_491 .cse13))) (or (not (= (select (select (store (store .cse11 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_491) .cse12 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_494) .cse12 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_494 .cse13) 0)) (= .cse12 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse11 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse14 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse14)))) .cse15) .cse16) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse19 (+ 4 v_subst_2))) (let ((.cse18 (select v_arrayElimArr_19 .cse19)) (.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (not (= (select (select (store (store .cse17 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse18 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse19) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse18 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse18) (= .cse18 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) .cse16) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse23 (+ v_prenex_318 4))) (let ((.cse21 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse20 (select v_prenex_317 .cse23))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse20 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse21 .cse20) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse21) (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse21 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse20) (not (= (select (select (store (store .cse22 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse20 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse20) (not (= (select v_prenex_320 .cse23) 0)))))) .cse16) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse27 (+ v_prenex_318 4))) (let ((.cse25 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse24 (select v_prenex_317 .cse27))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse24 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse25 .cse24) (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse25 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) .cse24) (not (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse24 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse24) (not (= (select v_prenex_320 .cse27) 0)))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse31 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse28 (+ 4 v_subst_1))) (let ((.cse30 (select v_arrayElimArr_22 .cse28))) (or (not (= (select v_arrayElimArr_23 .cse28) 0)) (not (= (select (select (store (store .cse29 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse30 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse30 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse30) (= .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse30 .cse31))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse29 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse31 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse35 (+ 4 v_subst_2))) (let ((.cse33 (select v_arrayElimArr_19 .cse35)) (.cse34 (select (select (store (store .cse32 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select (select (store (store .cse32 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse33 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse34) (not (= (select v_arrayElimArr_20 .cse35) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse33 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse33) (= .cse33 .cse34))))) .cse16) (or .cse16 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse40 (+ 4 v_subst_2)) (.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse39 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse38 (select (select (store (store .cse36 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse39 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse37 (select v_arrayElimArr_19 .cse40))) (or (not (= (select (select (store (store .cse36 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse37 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse38) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse39) (= .cse39 .cse37) (= .cse39 .cse38) (not (= (select v_arrayElimArr_20 .cse40) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse37 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse37)))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse45 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse44 (select (select (store (store .cse42 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse45 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse41 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse41) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse43 (select v_arrayElimArr_22 .cse41))) (or (not (= (select (select (store (store .cse42 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse43 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse43 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse43) (= .cse43 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse43 .cse44) (= .cse43 .cse45))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse44))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse46 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse46) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse47 (+ v_prenex_466 4))) (let ((.cse48 (select v_prenex_465 .cse47))) (or (not (= (select v_prenex_468 .cse47) 0)) (= .cse48 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_468) .cse48 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select (select (store (store .cse49 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_465) .cse48 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse49 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse46 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))))) .cse15) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse54 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse53 (select (select (store (store .cse50 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse54 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_490 (Array Int Int)) (v_prenex_491 (Array Int Int)) (v_prenex_493 (Array Int Int)) (v_prenex_494 (Array Int Int)) (v_prenex_495 (Array Int Int)) (v_prenex_492 Int)) (let ((.cse52 (+ v_prenex_492 4))) (let ((.cse51 (select v_prenex_491 .cse52))) (or (not (= (select (select (store (store .cse50 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_491) .cse51 v_prenex_490) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_493) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_494) .cse51 v_prenex_495) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select v_prenex_494 .cse52) 0)) (= .cse51 |c_ULTIMATE.start_main_~p~0#1.base|))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse53) (= .cse54 .cse53))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse54)))) .cse55) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse60 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse57 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse59 (select (select (store (store .cse57 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse60 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse56 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse56) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse58 (select v_arrayElimArr_22 .cse56))) (or (not (= (select (select (store (store .cse57 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse58 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse58 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse58) (= .cse58 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse58 .cse59))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse59) (= .cse60 .cse59))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse60)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse63 (+ 4 v_subst_1))) (let ((.cse61 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse62 (select v_arrayElimArr_22 .cse63)) (.cse64 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse61 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse62 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse63) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse62 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse62) (= .cse62 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse62 (select (select (store (store .cse61 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse64 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse62 .cse64))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse65 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse65) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse68 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse66 (select (select (store (store .cse68 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse65 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse66) (= .cse65 .cse66) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse67 (+ 4 v_subst_1))) (let ((.cse69 (select v_arrayElimArr_22 .cse67))) (or (not (= (select v_arrayElimArr_23 .cse67) 0)) (not (= (select (select (store (store .cse68 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse69 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse69 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse69) (= .cse69 |c_ULTIMATE.start_main_~a~0#1.base|)))))))))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse70 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse70) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse71 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse74 (select (select (store (store .cse71 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse70 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse73 (+ 4 v_subst_2))) (let ((.cse72 (select v_arrayElimArr_19 .cse73))) (or (not (= (select (select (store (store .cse71 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse72 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse73) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse72 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse72) (= .cse72 .cse74))))) (= .cse70 .cse74)))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse75 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse78 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse76 (select (select (store (store .cse78 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse75 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse75 .cse76) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse79 (+ v_prenex_318 4))) (let ((.cse77 (select v_prenex_317 .cse79))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse77 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse75 .cse77) (= .cse76 .cse77) (not (= (select (select (store (store .cse78 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse77 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse77) (not (= (select v_prenex_320 .cse79) 0)))))))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse75))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse84 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse83 (select (select (store (store .cse80 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse84 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse82 (+ 4 v_subst_2))) (let ((.cse81 (select v_arrayElimArr_19 .cse82))) (or (not (= (select (select (store (store .cse80 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse81 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse82) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse81 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse81) (= .cse81 .cse83))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse83) (= .cse84 .cse83))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse84)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse85 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse85) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse86 (select (select (store (store .cse88 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse85 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse86) (= .cse85 .cse86) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse89 (+ v_prenex_318 4))) (let ((.cse87 (select v_prenex_317 .cse89))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse87 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse85 .cse87) (= .cse86 .cse87) (not (= (select (select (store (store .cse88 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse87 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse87) (not (= (select v_prenex_320 .cse89) 0)))))))))))))) .cse16) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse92 (+ 4 v_subst_2))) (let ((.cse90 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse91 (select v_arrayElimArr_19 .cse92))) (or (not (= (select (select (store (store .cse90 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse91 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse90 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 (+ 4 v_subst_3)) v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (not (= (select v_arrayElimArr_20 .cse92) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse91 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse91))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse97 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse95 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse96 (select (select (store (store .cse95 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse97 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_466 Int) (v_prenex_464 (Array Int Int)) (v_prenex_465 (Array Int Int)) (v_prenex_467 (Array Int Int)) (v_prenex_468 (Array Int Int)) (v_prenex_469 (Array Int Int))) (let ((.cse93 (+ v_prenex_466 4))) (let ((.cse94 (select v_prenex_465 .cse93))) (or (not (= (select v_prenex_468 .cse93) 0)) (= .cse94 |c_ULTIMATE.start_main_~p~0#1.base|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_467) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_468) .cse94 v_prenex_469) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (not (= (select (select (store (store .cse95 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_465) .cse94 v_prenex_464) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse96) (= .cse97 .cse96))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse97)))) .cse55) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse102 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse98 (select (select (store (store .cse99 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse102 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse98) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_subst_1 Int)) (let ((.cse101 (+ 4 v_subst_1))) (let ((.cse100 (select v_arrayElimArr_22 .cse101))) (or (forall ((v_prenex_126 (Array Int Int))) (not (= (select (select (store (store .cse99 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse100 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse101) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse100 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse100) (= .cse100 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse100 .cse98) (= .cse100 .cse102))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse105 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse107 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse103 (select (select (store (store .cse105 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse107 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse103) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse104 (+ 4 v_subst_1))) (let ((.cse106 (select v_arrayElimArr_22 .cse104))) (or (not (= (select v_arrayElimArr_23 .cse104) 0)) (not (= (select (select (store (store .cse105 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse106 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse106 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse106) (= .cse106 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse106 .cse103) (= .cse106 .cse107))))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse112 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse111 (select (select (store (store .cse109 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse112 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_23 (Array Int Int)) (v_subst_1 Int)) (let ((.cse108 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse108) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse110 (select v_arrayElimArr_22 .cse108))) (or (not (= (select (select (store (store .cse109 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse110 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse110 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse110) (= .cse110 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse110 .cse111))))))) (= .cse112 .cse111))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse112)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int)) (let ((.cse113 (+ 4 v_subst_1))) (or (not (= (select v_arrayElimArr_23 .cse113) 0)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_prenex_126 (Array Int Int))) (let ((.cse114 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse115 (select v_arrayElimArr_22 .cse113)) (.cse116 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (not (= (select (select (store (store .cse114 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse115 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse115 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse115) (= .cse115 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse115 (select (select (store (store .cse114 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse116 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse115 .cse116))))))) (or .cse16 (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse117 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse119 (select v_arrayElimArr_21 (+ 4 v_subst_3))) (.cse121 (+ 4 v_subst_2))) (let ((.cse118 (select v_arrayElimArr_19 .cse121)) (.cse120 (select (select (store (store .cse117 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse119 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (= (select (select (store (store .cse117 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse118 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse119) (= .cse119 .cse120) (not (= (select v_arrayElimArr_20 .cse121) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse118 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse118) (= .cse118 .cse120)))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse123 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse122 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse123 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse122) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse123) (= .cse123 |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| .cse122))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse124 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse124) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse126 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse128 (select (select (store (store .cse126 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse124 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse125 (+ 4 v_subst_1))) (let ((.cse127 (select v_arrayElimArr_22 .cse125))) (or (not (= (select v_arrayElimArr_23 .cse125) 0)) (not (= (select (select (store (store .cse126 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse127 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse127 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse127) (= .cse127 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse127 .cse128))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse128)))))))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_subst_2 Int) (v_ArrVal_981 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse133 (+ 4 v_subst_2)) (.cse129 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse132 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse131 (select (select (store (store .cse129 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse132 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse130 (select v_arrayElimArr_19 .cse133))) (or (not (= (select (select (store (store .cse129 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse130 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse131) (= .cse132 .cse130) (= .cse132 .cse131) (not (= (select v_arrayElimArr_20 .cse133) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse130 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse130))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse137 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse134 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse136 (+ 4 v_subst_2))) (let ((.cse135 (select v_arrayElimArr_19 .cse136))) (or (not (= (select (select (store (store .cse134 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse135 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse136) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse135 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse135))))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store .cse134 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse137 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse137)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse142 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse138 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse140 (select (select (store (store .cse138 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse142 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse141 (+ 4 v_subst_2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse139 (select v_arrayElimArr_19 .cse141))) (or (not (= (select (select (store (store .cse138 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse139 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse139 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse139) (= .cse139 .cse140)))) (not (= (select v_arrayElimArr_20 .cse141) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse140))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse142))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse144 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse147 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse146 (select (select (store (store .cse144 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse147 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse143 (+ 4 v_subst_1))) (let ((.cse145 (select v_arrayElimArr_22 .cse143))) (or (not (= (select v_arrayElimArr_23 .cse143) 0)) (not (= (select (select (store (store .cse144 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse145 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse145 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse145) (= .cse145 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse145 .cse146))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse147) (= .cse147 .cse146))))) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse148 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse148) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse149 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse152 (select (select (store (store .cse149 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse148 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse151 (+ 4 v_subst_2))) (let ((.cse150 (select v_arrayElimArr_19 .cse151))) (or (not (= (select (select (store (store .cse149 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse150 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse151) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse150 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse150) (= .cse150 .cse152))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse152)))))))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse153 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse153) (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse156 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse154 (select (select (store (store .cse156 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse153 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| .cse154) (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (v_prenex_318 Int)) (let ((.cse157 (+ v_prenex_318 4))) (let ((.cse155 (select v_prenex_317 .cse157))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse155 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse153 .cse155) (= .cse154 .cse155) (not (= (select (select (store (store .cse156 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse155 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse155) (not (= (select v_prenex_320 .cse157) 0)))))))))))))) .cse16) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse162 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse159 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse161 (select (select (store (store .cse159 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse162 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse158 (+ 4 v_subst_1))) (let ((.cse160 (select v_arrayElimArr_22 .cse158))) (or (not (= (select v_arrayElimArr_23 .cse158) 0)) (not (= (select (select (store (store .cse159 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse160 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse160 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse160) (= .cse160 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse160 .cse161))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse161) (= .cse162 .cse161))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse162)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_ArrVal_981 (Array Int Int)) (v_subst_1 Int) (v_prenex_126 (Array Int Int))) (let ((.cse163 (+ 4 v_subst_1))) (let ((.cse164 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse165 (select v_arrayElimArr_22 .cse163)) (.cse166 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (not (= (select v_arrayElimArr_23 .cse163) 0)) (not (= (select (select (store (store .cse164 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) .cse165 v_prenex_126) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) .cse165 v_ArrVal_980) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse165) (= .cse165 |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse165 (select (select (store (store .cse164 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse166 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (= .cse165 .cse166))))) (or (forall ((v_prenex_316 (Array Int Int)) (v_prenex_317 (Array Int Int)) (v_arrayElimArr_21 (Array Int Int)) (v_prenex_319 (Array Int Int)) (v_prenex_320 (Array Int Int)) (v_prenex_321 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int) (v_subst_3 Int) (v_prenex_318 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse171 (+ v_prenex_318 4)) (.cse170 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse168 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (let ((.cse169 (select (select (store (store .cse170 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse168 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse167 (select v_prenex_317 .cse171))) (or (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_319) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_320) .cse167 v_prenex_321) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse168 .cse167) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse169) (= .cse169 .cse167) (not (= (select (select (store (store .cse170 |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_317) .cse167 v_prenex_316) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse167) (not (= (select v_prenex_320 .cse171) 0)))))) .cse16) (or (and (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse176 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse172 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse174 (select (select (store (store .cse172 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse176 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_subst_2 Int) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse175 (+ 4 v_subst_2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_127 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse173 (select v_arrayElimArr_19 .cse175))) (or (not (= (select (select (store (store .cse172 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse173 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse173 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse173) (= .cse173 .cse174)))) (not (= (select v_arrayElimArr_20 .cse175) 0))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse174) (= .cse176 .cse174))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse176)))) (forall ((v_arrayElimArr_21 (Array Int Int)) (v_subst_3 Int)) (let ((.cse181 (select v_arrayElimArr_21 (+ 4 v_subst_3)))) (or (forall ((|ULTIMATE.start_main_~p~0#1.offset| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse177 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse5 (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)))) (let ((.cse180 (select (select (store (store .cse177 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_21) .cse181 v_ArrVal_981) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_prenex_129 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_subst_2 Int) (v_prenex_127 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_128 (Array Int Int))) (let ((.cse179 (+ 4 v_subst_2))) (let ((.cse178 (select v_arrayElimArr_19 .cse179))) (or (not (= (select (select (store (store .cse177 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_19) .cse178 v_prenex_129) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select v_arrayElimArr_20 .cse179) 0)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_127) |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_20) .cse178 v_prenex_128) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse178))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse180) (= .cse181 .cse180))))) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse181))))) .cse16))))) is different from true