./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:45:02,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:45:02,686 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:45:02,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:45:02,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:45:02,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:45:02,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:45:02,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:45:02,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:45:02,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:45:02,770 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:45:02,771 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:45:02,771 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:45:02,771 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:45:02,773 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:45:02,773 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:45:02,774 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:45:02,774 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:45:02,774 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:45:02,774 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:45:02,774 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:45:02,775 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:45:02,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:45:02,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:45:02,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:45:02,776 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:45:02,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:45:02,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:45:02,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:45:02,776 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:45:02,776 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:45:02,776 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:45:02,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:45:02,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:45:02,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:45:02,778 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:45:02,778 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:45:02,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:45:02,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:45:02,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:45:02,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:45:02,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:45:02,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:45:02,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:45:02,780 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:45:02,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:45:02,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:45:02,780 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:45:02,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:45:02,781 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-11-14 03:45:03,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:45:03,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:45:03,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:45:03,251 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:45:03,252 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:45:03,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i Unable to find full path for "g++" [2024-11-14 03:45:05,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:45:06,375 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:45:06,376 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-14 03:45:06,401 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/data/ca7da1e1a/4b234b25f38444629f44f0b730adb1cb/FLAGf08faeb3e [2024-11-14 03:45:06,438 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/data/ca7da1e1a/4b234b25f38444629f44f0b730adb1cb [2024-11-14 03:45:06,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:45:06,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:45:06,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:45:06,452 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:45:06,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:45:06,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:45:06" (1/1) ... [2024-11-14 03:45:06,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f394345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:06, skipping insertion in model container [2024-11-14 03:45:06,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:45:06" (1/1) ... [2024-11-14 03:45:06,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:45:07,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:45:07,143 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:45:07,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:45:07,271 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:45:07,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07 WrapperNode [2024-11-14 03:45:07,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:45:07,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:45:07,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:45:07,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:45:07,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,343 INFO L138 Inliner]: procedures = 119, calls = 46, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2024-11-14 03:45:07,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:45:07,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:45:07,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:45:07,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:45:07,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:45:07,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:45:07,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:45:07,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:45:07,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (1/1) ... [2024-11-14 03:45:07,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:45:07,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:45:07,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:45:07,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:45:07,475 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 03:45:07,475 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 03:45:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:45:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:45:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:45:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:45:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:45:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:45:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:45:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:45:07,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:45:07,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:45:07,668 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:45:07,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:45:08,475 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-14 03:45:08,476 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:45:08,603 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:45:08,607 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-14 03:45:08,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:45:08 BoogieIcfgContainer [2024-11-14 03:45:08,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:45:08,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:45:08,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:45:08,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:45:08,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:45:06" (1/3) ... [2024-11-14 03:45:08,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563a122c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:45:08, skipping insertion in model container [2024-11-14 03:45:08,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:45:07" (2/3) ... [2024-11-14 03:45:08,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563a122c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:45:08, skipping insertion in model container [2024-11-14 03:45:08,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:45:08" (3/3) ... [2024-11-14 03:45:08,624 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-11-14 03:45:08,645 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:45:08,647 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-rb-cnstr_1-1.i that has 2 procedures, 144 locations, 1 initial locations, 10 loop locations, and 65 error locations. [2024-11-14 03:45:08,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:45:08,716 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@5e513533, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:45:08,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2024-11-14 03:45:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 70 states have (on average 2.342857142857143) internal successors, (164), 135 states have internal predecessors, (164), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-14 03:45:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:45:08,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:08,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:45:08,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:08,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash 11204, now seen corresponding path program 1 times [2024-11-14 03:45:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:08,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601417328] [2024-11-14 03:45:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:08,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:09,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:09,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601417328] [2024-11-14 03:45:09,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601417328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:09,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:09,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:45:09,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374703110] [2024-11-14 03:45:09,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:09,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:45:09,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:09,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:45:09,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:45:09,120 INFO L87 Difference]: Start difference. First operand has 144 states, 70 states have (on average 2.342857142857143) internal successors, (164), 135 states have internal predecessors, (164), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:09,468 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2024-11-14 03:45:09,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:45:09,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-14 03:45:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:09,485 INFO L225 Difference]: With dead ends: 130 [2024-11-14 03:45:09,486 INFO L226 Difference]: Without dead ends: 129 [2024-11-14 03:45:09,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:45:09,496 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 104 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:09,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 80 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:45:09,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-14 03:45:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-14 03:45:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 64 states have (on average 2.109375) internal successors, (135), 127 states have internal predecessors, (135), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2024-11-14 03:45:09,572 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 2 [2024-11-14 03:45:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:09,573 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2024-11-14 03:45:09,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2024-11-14 03:45:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:45:09,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:09,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:45:09,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:45:09,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:09,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 11205, now seen corresponding path program 1 times [2024-11-14 03:45:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:09,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989859274] [2024-11-14 03:45:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:09,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:09,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989859274] [2024-11-14 03:45:09,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989859274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:09,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:09,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:45:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607678903] [2024-11-14 03:45:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:09,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:45:09,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:09,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:45:09,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:45:09,740 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:10,023 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2024-11-14 03:45:10,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:45:10,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-14 03:45:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:10,027 INFO L225 Difference]: With dead ends: 165 [2024-11-14 03:45:10,030 INFO L226 Difference]: Without dead ends: 165 [2024-11-14 03:45:10,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:45:10,032 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 43 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:10,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 163 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:45:10,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-14 03:45:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2024-11-14 03:45:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 87 states have (on average 2.0) internal successors, (174), 147 states have internal predecessors, (174), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 181 transitions. [2024-11-14 03:45:10,063 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 181 transitions. Word has length 2 [2024-11-14 03:45:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:10,064 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 181 transitions. [2024-11-14 03:45:10,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 181 transitions. [2024-11-14 03:45:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 03:45:10,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:10,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:10,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:45:10,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:10,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1366429924, now seen corresponding path program 1 times [2024-11-14 03:45:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:10,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607917464] [2024-11-14 03:45:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:10,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:10,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607917464] [2024-11-14 03:45:10,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607917464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:10,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:10,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:45:10,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337641066] [2024-11-14 03:45:10,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:10,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:45:10,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:10,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:45:10,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:45:10,507 INFO L87 Difference]: Start difference. First operand 149 states and 181 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:10,891 INFO L93 Difference]: Finished difference Result 138 states and 171 transitions. [2024-11-14 03:45:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:45:10,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 03:45:10,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:10,895 INFO L225 Difference]: With dead ends: 138 [2024-11-14 03:45:10,895 INFO L226 Difference]: Without dead ends: 138 [2024-11-14 03:45:10,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:45:10,897 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 135 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:10,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 65 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:45:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-14 03:45:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-14 03:45:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 91 states have (on average 1.8021978021978022) internal successors, (164), 136 states have internal predecessors, (164), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2024-11-14 03:45:10,910 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 7 [2024-11-14 03:45:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:10,910 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions. [2024-11-14 03:45:10,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions. [2024-11-14 03:45:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 03:45:10,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:10,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:10,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:45:10,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:10,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1366429923, now seen corresponding path program 1 times [2024-11-14 03:45:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417022438] [2024-11-14 03:45:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:11,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:11,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417022438] [2024-11-14 03:45:11,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417022438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:11,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:11,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:45:11,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148086047] [2024-11-14 03:45:11,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:11,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:45:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:11,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:45:11,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:45:11,306 INFO L87 Difference]: Start difference. First operand 138 states and 171 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:11,881 INFO L93 Difference]: Finished difference Result 154 states and 186 transitions. [2024-11-14 03:45:11,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:45:11,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 03:45:11,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:11,884 INFO L225 Difference]: With dead ends: 154 [2024-11-14 03:45:11,884 INFO L226 Difference]: Without dead ends: 154 [2024-11-14 03:45:11,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:45:11,889 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 114 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:11,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 132 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:45:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-14 03:45:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2024-11-14 03:45:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.7125) internal successors, (137), 124 states have internal predecessors, (137), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2024-11-14 03:45:11,907 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 7 [2024-11-14 03:45:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:11,907 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2024-11-14 03:45:11,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2024-11-14 03:45:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:45:11,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:11,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:11,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:45:11,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:11,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1121116387, now seen corresponding path program 1 times [2024-11-14 03:45:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676538364] [2024-11-14 03:45:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:11,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:12,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:12,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676538364] [2024-11-14 03:45:12,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676538364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:12,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:12,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:45:12,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767452158] [2024-11-14 03:45:12,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:12,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:45:12,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:12,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:45:12,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:45:12,144 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:12,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:12,492 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2024-11-14 03:45:12,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:45:12,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:45:12,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:12,494 INFO L225 Difference]: With dead ends: 125 [2024-11-14 03:45:12,494 INFO L226 Difference]: Without dead ends: 125 [2024-11-14 03:45:12,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:45:12,496 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:12,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 287 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:45:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-14 03:45:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-14 03:45:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 80 states have (on average 1.6875) internal successors, (135), 123 states have internal predecessors, (135), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2024-11-14 03:45:12,506 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 9 [2024-11-14 03:45:12,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:12,506 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2024-11-14 03:45:12,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2024-11-14 03:45:12,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:45:12,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:12,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:12,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:45:12,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:12,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1121116388, now seen corresponding path program 1 times [2024-11-14 03:45:12,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:12,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658533907] [2024-11-14 03:45:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:12,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:12,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658533907] [2024-11-14 03:45:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658533907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:45:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520816592] [2024-11-14 03:45:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:12,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:45:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:45:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:45:12,851 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:13,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:13,207 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2024-11-14 03:45:13,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:45:13,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:45:13,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:13,211 INFO L225 Difference]: With dead ends: 124 [2024-11-14 03:45:13,211 INFO L226 Difference]: Without dead ends: 124 [2024-11-14 03:45:13,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:45:13,217 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:13,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 270 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:45:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-14 03:45:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-14 03:45:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 80 states have (on average 1.6625) internal successors, (133), 122 states have internal predecessors, (133), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2024-11-14 03:45:13,238 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 9 [2024-11-14 03:45:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:13,238 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2024-11-14 03:45:13,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2024-11-14 03:45:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:45:13,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:13,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:13,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:45:13,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:13,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:13,241 INFO L85 PathProgramCache]: Analyzing trace with hash -862827347, now seen corresponding path program 1 times [2024-11-14 03:45:13,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:13,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552204482] [2024-11-14 03:45:13,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:13,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:13,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:13,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552204482] [2024-11-14 03:45:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552204482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:13,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:45:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104763076] [2024-11-14 03:45:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:13,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:45:13,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:45:13,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:45:13,343 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:13,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:13,589 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2024-11-14 03:45:13,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:45:13,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 03:45:13,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:13,591 INFO L225 Difference]: With dead ends: 128 [2024-11-14 03:45:13,591 INFO L226 Difference]: Without dead ends: 128 [2024-11-14 03:45:13,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:45:13,592 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 109 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:13,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 145 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:45:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-14 03:45:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 123. [2024-11-14 03:45:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 80 states have (on average 1.625) internal successors, (130), 121 states have internal predecessors, (130), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2024-11-14 03:45:13,610 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 11 [2024-11-14 03:45:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:13,610 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2024-11-14 03:45:13,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2024-11-14 03:45:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:45:13,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:13,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:13,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:45:13,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:13,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:13,612 INFO L85 PathProgramCache]: Analyzing trace with hash -643659381, now seen corresponding path program 1 times [2024-11-14 03:45:13,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:13,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261220043] [2024-11-14 03:45:13,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:13,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:14,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:14,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261220043] [2024-11-14 03:45:14,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261220043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:14,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:14,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:45:14,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997214527] [2024-11-14 03:45:14,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:14,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:45:14,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:14,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:45:14,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:45:14,366 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:15,234 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2024-11-14 03:45:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:45:15,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 03:45:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:15,236 INFO L225 Difference]: With dead ends: 135 [2024-11-14 03:45:15,236 INFO L226 Difference]: Without dead ends: 135 [2024-11-14 03:45:15,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:45:15,238 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 168 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:15,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 170 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:45:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-14 03:45:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2024-11-14 03:45:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 123 states have internal predecessors, (135), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2024-11-14 03:45:15,255 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 11 [2024-11-14 03:45:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:15,255 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2024-11-14 03:45:15,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2024-11-14 03:45:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:45:15,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:15,256 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:15,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:45:15,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:15,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:15,257 INFO L85 PathProgramCache]: Analyzing trace with hash -643659382, now seen corresponding path program 1 times [2024-11-14 03:45:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:15,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587819842] [2024-11-14 03:45:15,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:15,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587819842] [2024-11-14 03:45:15,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587819842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:15,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:15,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:45:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119217959] [2024-11-14 03:45:15,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:45:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:15,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:45:15,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:45:15,692 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:16,346 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2024-11-14 03:45:16,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:45:16,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 03:45:16,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:16,348 INFO L225 Difference]: With dead ends: 124 [2024-11-14 03:45:16,349 INFO L226 Difference]: Without dead ends: 124 [2024-11-14 03:45:16,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:45:16,351 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 121 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:16,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 189 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:45:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-14 03:45:16,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-14 03:45:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.5227272727272727) internal successors, (134), 122 states have internal predecessors, (134), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2024-11-14 03:45:16,362 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 11 [2024-11-14 03:45:16,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:16,363 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2024-11-14 03:45:16,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2024-11-14 03:45:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-14 03:45:16,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:16,366 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:16,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:45:16,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:16,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:16,368 INFO L85 PathProgramCache]: Analyzing trace with hash 299314592, now seen corresponding path program 1 times [2024-11-14 03:45:16,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:16,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969783710] [2024-11-14 03:45:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:16,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969783710] [2024-11-14 03:45:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969783710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:16,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:45:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931240931] [2024-11-14 03:45:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:16,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:45:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:45:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:45:16,521 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:16,868 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2024-11-14 03:45:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:45:16,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-14 03:45:16,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:16,870 INFO L225 Difference]: With dead ends: 163 [2024-11-14 03:45:16,871 INFO L226 Difference]: Without dead ends: 163 [2024-11-14 03:45:16,871 INFO L431 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 [2024-11-14 03:45:16,872 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 64 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:16,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 224 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:45:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-14 03:45:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 131. [2024-11-14 03:45:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 129 states have internal predecessors, (142), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2024-11-14 03:45:16,880 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 14 [2024-11-14 03:45:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:16,880 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2024-11-14 03:45:16,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2024-11-14 03:45:16,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:45:16,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:16,882 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:16,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:45:16,882 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:16,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:16,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1888246236, now seen corresponding path program 1 times [2024-11-14 03:45:16,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:16,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969203495] [2024-11-14 03:45:16,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:16,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:17,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:17,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969203495] [2024-11-14 03:45:17,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969203495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:17,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:17,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:45:17,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194240929] [2024-11-14 03:45:17,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:17,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:45:17,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:17,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:45:17,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:45:17,134 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:17,396 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2024-11-14 03:45:17,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:45:17,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 03:45:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:17,397 INFO L225 Difference]: With dead ends: 130 [2024-11-14 03:45:17,397 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 03:45:17,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:45:17,398 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:17,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 263 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:45:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 03:45:17,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-14 03:45:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 128 states have internal predecessors, (141), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2024-11-14 03:45:17,404 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 16 [2024-11-14 03:45:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:17,405 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2024-11-14 03:45:17,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:17,405 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2024-11-14 03:45:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:45:17,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:17,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:17,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:45:17,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:17,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1888246237, now seen corresponding path program 1 times [2024-11-14 03:45:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540760396] [2024-11-14 03:45:17,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:17,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:17,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540760396] [2024-11-14 03:45:17,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540760396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:17,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:17,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:45:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646381052] [2024-11-14 03:45:17,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:17,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:45:17,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:17,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:45:17,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:45:17,728 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:18,009 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2024-11-14 03:45:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:45:18,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 03:45:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:18,012 INFO L225 Difference]: With dead ends: 129 [2024-11-14 03:45:18,012 INFO L226 Difference]: Without dead ends: 129 [2024-11-14 03:45:18,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:45:18,013 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:18,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 251 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:45:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-14 03:45:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-14 03:45:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 127 states have internal predecessors, (140), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2024-11-14 03:45:18,020 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 16 [2024-11-14 03:45:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:18,021 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2024-11-14 03:45:18,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2024-11-14 03:45:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:45:18,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:18,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:18,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:45:18,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:18,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1460982137, now seen corresponding path program 1 times [2024-11-14 03:45:18,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:18,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284932445] [2024-11-14 03:45:18,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:18,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:18,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:18,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284932445] [2024-11-14 03:45:18,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284932445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:18,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:45:18,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:45:18,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057945051] [2024-11-14 03:45:18,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:18,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:45:18,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:18,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:45:18,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:45:18,177 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:45:18,366 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2024-11-14 03:45:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:45:18,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 03:45:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:45:18,367 INFO L225 Difference]: With dead ends: 128 [2024-11-14 03:45:18,367 INFO L226 Difference]: Without dead ends: 128 [2024-11-14 03:45:18,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:45:18,368 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:45:18,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 188 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:45:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-14 03:45:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-14 03:45:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 126 states have internal predecessors, (138), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2024-11-14 03:45:18,375 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 18 [2024-11-14 03:45:18,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:45:18,375 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2024-11-14 03:45:18,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2024-11-14 03:45:18,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:45:18,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:45:18,377 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:45:18,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:45:18,377 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:45:18,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:45:18,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1885772309, now seen corresponding path program 1 times [2024-11-14 03:45:18,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:45:18,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178259907] [2024-11-14 03:45:18,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:18,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:45:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:18,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:45:18,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178259907] [2024-11-14 03:45:18,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178259907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:45:18,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249350678] [2024-11-14 03:45:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:45:18,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:45:18,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:45:18,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:45:18,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:45:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:45:18,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 03:45:18,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:45:18,938 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-14 03:45:18,950 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-14 03:45:19,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-14 03:45:19,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-14 03:45:19,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:45:19,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-11-14 03:45:19,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-14 03:45:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:19,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:45:20,024 INFO L378 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 10 treesize of output 8 [2024-11-14 03:45:20,034 INFO L378 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 14 treesize of output 12 [2024-11-14 03:45:20,048 INFO L378 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 10 treesize of output 8 [2024-11-14 03:45:20,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:45:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:45:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249350678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:45:20,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1066421968] [2024-11-14 03:45:20,101 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:45:20,101 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:45:20,107 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:45:20,113 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:45:20,113 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:45:21,342 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:45:46,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1066421968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:45:46,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:45:46,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 6, 5] total 20 [2024-11-14 03:45:46,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978902207] [2024-11-14 03:45:46,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:45:46,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:45:46,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:45:46,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:45:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=250, Unknown=5, NotChecked=0, Total=380 [2024-11-14 03:45:46,228 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:45:49,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:45:52,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:45:54,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:45:56,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:45:58,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:00,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:02,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:04,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:06,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:08,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:10,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:12,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:13,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:46:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:14,840 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2024-11-14 03:46:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:46:14,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 03:46:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:14,842 INFO L225 Difference]: With dead ends: 144 [2024-11-14 03:46:14,842 INFO L226 Difference]: Without dead ends: 144 [2024-11-14 03:46:14,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=125, Invalid=250, Unknown=5, NotChecked=0, Total=380 [2024-11-14 03:46:14,844 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:14,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 172 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 13 Unknown, 0 Unchecked, 27.3s Time] [2024-11-14 03:46:14,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-14 03:46:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2024-11-14 03:46:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 132 states have internal predecessors, (145), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2024-11-14 03:46:14,850 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 18 [2024-11-14 03:46:14,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:14,850 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2024-11-14 03:46:14,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2024-11-14 03:46:14,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:46:14,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:14,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:14,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 03:46:15,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 03:46:15,056 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:46:15,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:15,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2128683171, now seen corresponding path program 1 times [2024-11-14 03:46:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:15,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216645080] [2024-11-14 03:46:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:15,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:15,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216645080] [2024-11-14 03:46:15,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216645080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:15,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:15,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:46:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782416177] [2024-11-14 03:46:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:15,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:46:15,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:15,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:46:15,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:46:15,407 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:16,031 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2024-11-14 03:46:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:46:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 03:46:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:16,035 INFO L225 Difference]: With dead ends: 134 [2024-11-14 03:46:16,035 INFO L226 Difference]: Without dead ends: 134 [2024-11-14 03:46:16,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:46:16,036 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 36 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:16,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 231 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:46:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-14 03:46:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2024-11-14 03:46:16,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 131 states have internal predecessors, (144), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 149 transitions. [2024-11-14 03:46:16,042 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 149 transitions. Word has length 18 [2024-11-14 03:46:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:16,042 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 149 transitions. [2024-11-14 03:46:16,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 149 transitions. [2024-11-14 03:46:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:46:16,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:16,047 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:16,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 03:46:16,047 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:46:16,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2128683172, now seen corresponding path program 1 times [2024-11-14 03:46:16,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:16,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242806469] [2024-11-14 03:46:16,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:16,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:16,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242806469] [2024-11-14 03:46:16,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242806469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:16,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:16,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:46:16,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100436138] [2024-11-14 03:46:16,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:16,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:46:16,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:16,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:46:16,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:46:16,557 INFO L87 Difference]: Start difference. First operand 133 states and 149 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:17,385 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2024-11-14 03:46:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:46:17,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 03:46:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:17,386 INFO L225 Difference]: With dead ends: 130 [2024-11-14 03:46:17,387 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 03:46:17,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:46:17,388 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 52 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:17,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 331 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:46:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 03:46:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2024-11-14 03:46:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 110 states have internal predecessors, (120), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2024-11-14 03:46:17,393 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 18 [2024-11-14 03:46:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:17,393 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2024-11-14 03:46:17,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2024-11-14 03:46:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:46:17,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:17,395 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:17,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 03:46:17,395 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:46:17,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:17,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1084319371, now seen corresponding path program 1 times [2024-11-14 03:46:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:17,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383386516] [2024-11-14 03:46:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:17,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383386516] [2024-11-14 03:46:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383386516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:46:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660005368] [2024-11-14 03:46:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:17,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:46:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:17,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:46:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:46:17,605 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:17,826 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-14 03:46:17,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:46:17,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 03:46:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:17,828 INFO L225 Difference]: With dead ends: 112 [2024-11-14 03:46:17,828 INFO L226 Difference]: Without dead ends: 112 [2024-11-14 03:46:17,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:46:17,829 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:17,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 184 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:46:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-14 03:46:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-14 03:46:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 87 states have (on average 1.367816091954023) internal successors, (119), 109 states have internal predecessors, (119), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2024-11-14 03:46:17,834 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 21 [2024-11-14 03:46:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:17,835 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2024-11-14 03:46:17,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2024-11-14 03:46:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:46:17,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:17,836 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:17,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 03:46:17,836 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:46:17,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:17,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1593786090, now seen corresponding path program 1 times [2024-11-14 03:46:17,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:17,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490386080] [2024-11-14 03:46:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:17,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:18,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:18,139 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:18,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490386080] [2024-11-14 03:46:18,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490386080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:18,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:46:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778123656] [2024-11-14 03:46:18,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:18,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:46:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:46:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:46:18,141 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:19,013 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2024-11-14 03:46:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:46:19,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-14 03:46:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:19,015 INFO L225 Difference]: With dead ends: 127 [2024-11-14 03:46:19,015 INFO L226 Difference]: Without dead ends: 127 [2024-11-14 03:46:19,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:46:19,016 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 133 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:19,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 239 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:46:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-14 03:46:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2024-11-14 03:46:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 116 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2024-11-14 03:46:19,021 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 23 [2024-11-14 03:46:19,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:19,022 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2024-11-14 03:46:19,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2024-11-14 03:46:19,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:46:19,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:19,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:19,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:46:19,023 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:46:19,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:19,024 INFO L85 PathProgramCache]: Analyzing trace with hash -764715050, now seen corresponding path program 1 times [2024-11-14 03:46:19,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:19,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663438922] [2024-11-14 03:46:19,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:19,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:46:19,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:19,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663438922] [2024-11-14 03:46:19,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663438922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:19,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:46:19,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:46:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823677508] [2024-11-14 03:46:19,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:19,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:46:19,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:19,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:46:19,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:19,084 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 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) [2024-11-14 03:46:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:19,215 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2024-11-14 03:46:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:46:19,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-14 03:46:19,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:19,216 INFO L225 Difference]: With dead ends: 120 [2024-11-14 03:46:19,216 INFO L226 Difference]: Without dead ends: 120 [2024-11-14 03:46:19,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:46:19,217 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 46 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:19,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 81 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:46:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-14 03:46:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-14 03:46:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 118 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2024-11-14 03:46:19,226 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 23 [2024-11-14 03:46:19,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:19,227 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2024-11-14 03:46:19,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 2 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) [2024-11-14 03:46:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2024-11-14 03:46:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:46:19,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:19,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:19,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 03:46:19,230 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:46:19,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:19,231 INFO L85 PathProgramCache]: Analyzing trace with hash -451745831, now seen corresponding path program 1 times [2024-11-14 03:46:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185260316] [2024-11-14 03:46:19,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:19,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:19,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185260316] [2024-11-14 03:46:19,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185260316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:46:19,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422026629] [2024-11-14 03:46:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:19,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:46:19,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:46:19,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:46:19,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:46:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:19,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:46:19,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:19,580 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-14 03:46:19,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-14 03:46:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:46:19,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:46:19,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422026629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:19,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:46:19,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-14 03:46:19,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327522373] [2024-11-14 03:46:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:19,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:46:19,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:46:19,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:46:19,705 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:19,956 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2024-11-14 03:46:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:46:19,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-14 03:46:19,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:19,958 INFO L225 Difference]: With dead ends: 126 [2024-11-14 03:46:19,958 INFO L226 Difference]: Without dead ends: 126 [2024-11-14 03:46:19,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:46:19,959 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:19,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 190 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:46:19,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-14 03:46:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2024-11-14 03:46:19,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 121 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2024-11-14 03:46:19,965 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 25 [2024-11-14 03:46:19,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:19,965 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2024-11-14 03:46:19,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:19,965 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2024-11-14 03:46:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:46:19,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:19,966 INFO L215 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, 1, 1, 1] [2024-11-14 03:46:19,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:46:20,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:46:20,168 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:46:20,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:20,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1533278139, now seen corresponding path program 1 times [2024-11-14 03:46:20,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:20,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556510232] [2024-11-14 03:46:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:20,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:46:20,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556510232] [2024-11-14 03:46:20,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556510232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:46:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118482028] [2024-11-14 03:46:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:20,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:46:20,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:46:20,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:46:20,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:46:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:20,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 03:46:20,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:20,648 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-14 03:46:20,657 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-14 03:46:20,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-14 03:46:20,689 INFO L378 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 [2024-11-14 03:46:20,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:46:20,750 INFO L378 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 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-14 03:46:20,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-14 03:46:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:46:21,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:21,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:46:21,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118482028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:46:21,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [549603575] [2024-11-14 03:46:21,321 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-14 03:46:21,321 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:46:21,322 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:46:21,322 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:46:21,322 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:46:22,294 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:46:36,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [549603575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:36,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:46:36,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [7, 6, 5] total 21 [2024-11-14 03:46:36,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675698518] [2024-11-14 03:46:36,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:36,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:46:36,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:36,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:46:36,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=302, Unknown=1, NotChecked=0, Total=420 [2024-11-14 03:46:36,334 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:46:39,230 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2024-11-14 03:46:39,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:46:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 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 [2024-11-14 03:46:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:46:39,233 INFO L225 Difference]: With dead ends: 133 [2024-11-14 03:46:39,233 INFO L226 Difference]: Without dead ends: 133 [2024-11-14 03:46:39,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=117, Invalid=302, Unknown=1, NotChecked=0, Total=420 [2024-11-14 03:46:39,234 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 3 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:46:39,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 245 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 470 Invalid, 3 Unknown, 0 Unchecked, 2.9s Time] [2024-11-14 03:46:39,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-14 03:46:39,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2024-11-14 03:46:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 126 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2024-11-14 03:46:39,243 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 26 [2024-11-14 03:46:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:46:39,243 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2024-11-14 03:46:39,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:46:39,243 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-11-14 03:46:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:46:39,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:46:39,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:46:39,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:46:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:46:39,452 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:46:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:46:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1533280662, now seen corresponding path program 1 times [2024-11-14 03:46:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:46:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130922575] [2024-11-14 03:46:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:46:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:46:39,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:46:39,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130922575] [2024-11-14 03:46:39,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130922575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:46:39,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438363790] [2024-11-14 03:46:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:46:39,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:46:39,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:46:39,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:46:39,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:46:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:46:39,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 03:46:39,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:46:39,880 INFO L378 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 13 treesize of output 9 [2024-11-14 03:46:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:46:39,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:46:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:46:40,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438363790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:46:40,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2125847367] [2024-11-14 03:46:40,010 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 03:46:40,010 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:46:40,010 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:46:40,010 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:46:40,011 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:46:40,768 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:46:56,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2125847367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:46:56,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:46:56,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [2, 2, 2] total 17 [2024-11-14 03:46:56,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091242293] [2024-11-14 03:46:56,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:46:56,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 03:46:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:46:56,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 03:46:56,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=239, Unknown=1, NotChecked=0, Total=342 [2024-11-14 03:46:56,939 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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) [2024-11-14 03:46:59,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:47:01,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:01,507 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2024-11-14 03:47:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 03:47:01,509 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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 26 [2024-11-14 03:47:01,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:01,510 INFO L225 Difference]: With dead ends: 129 [2024-11-14 03:47:01,510 INFO L226 Difference]: Without dead ends: 109 [2024-11-14 03:47:01,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=102, Invalid=239, Unknown=1, NotChecked=0, Total=342 [2024-11-14 03:47:01,514 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:01,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 264 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 457 Invalid, 3 Unknown, 0 Unchecked, 4.5s Time] [2024-11-14 03:47:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-14 03:47:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-14 03:47:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 107 states have internal predecessors, (115), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:47:01,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2024-11-14 03:47:01,523 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 26 [2024-11-14 03:47:01,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:01,523 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2024-11-14 03:47:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 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) [2024-11-14 03:47:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2024-11-14 03:47:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:47:01,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:01,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:01,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 03:47:01,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:47:01,730 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:47:01,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1450155915, now seen corresponding path program 1 times [2024-11-14 03:47:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:47:01,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897828635] [2024-11-14 03:47:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:47:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:47:02,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:47:02,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897828635] [2024-11-14 03:47:02,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897828635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:47:02,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:47:02,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:47:02,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759262500] [2024-11-14 03:47:02,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:47:02,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:47:02,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:47:02,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:47:02,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:47:02,074 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:47:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:47:02,689 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2024-11-14 03:47:02,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:47:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-14 03:47:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:47:02,690 INFO L225 Difference]: With dead ends: 116 [2024-11-14 03:47:02,690 INFO L226 Difference]: Without dead ends: 116 [2024-11-14 03:47:02,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:47:02,691 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 41 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:47:02,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 283 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:47:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-14 03:47:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2024-11-14 03:47:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:47:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-14 03:47:02,697 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 29 [2024-11-14 03:47:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:47:02,697 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-14 03:47:02,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:47:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-14 03:47:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:47:02,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:47:02,699 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:47:02,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-14 03:47:02,700 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:47:02,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:47:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash -55548676, now seen corresponding path program 1 times [2024-11-14 03:47:02,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:47:02,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330815973] [2024-11-14 03:47:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:47:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:47:03,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:47:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330815973] [2024-11-14 03:47:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330815973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:47:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360063685] [2024-11-14 03:47:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:47:03,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:47:03,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:47:03,493 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:47:03,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:47:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:47:03,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 03:47:03,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:47:03,686 INFO L378 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 [2024-11-14 03:47:03,716 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-14 03:47:03,831 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:47:03,831 INFO L378 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 [2024-11-14 03:47:03,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:03,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:47:03,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:47:04,074 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:47:04,074 INFO L378 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 41 treesize of output 38 [2024-11-14 03:47:04,083 INFO L378 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 24 treesize of output 11 [2024-11-14 03:47:04,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 03:47:04,133 INFO L378 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 16 treesize of output 11 [2024-11-14 03:47:04,159 INFO L378 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 16 treesize of output 11 [2024-11-14 03:47:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:47:04,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:47:04,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-14 03:47:04,377 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-14 03:47:04,395 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_952 (Array Int Int)) (v_ArrVal_955 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_952) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_953) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-14 03:47:04,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:04,493 INFO L378 Elim1Store]: Elim1 eliminated variable 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 33 treesize of output 34 [2024-11-14 03:47:04,501 INFO L378 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 60 treesize of output 52 [2024-11-14 03:47:04,510 INFO L378 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 24 treesize of output 22 [2024-11-14 03:47:04,621 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (or (not .cse0) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_arrayElimCell_26 Int) (v_ArrVal_950 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_952) v_arrayElimCell_26 v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= v_ArrVal_950 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_950 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (or (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= v_ArrVal_950 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_950 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) .cse0) (forall ((v_ArrVal_950 (Array Int Int))) (or (forall ((v_ArrVal_955 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_950))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_952 (Array Int Int)) (v_arrayElimCell_26 Int)) (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_952) v_arrayElimCell_26 v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (not (= v_ArrVal_950 (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_950 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) is different from false [2024-11-14 03:47:04,973 INFO L378 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 251 treesize of output 247 [2024-11-14 03:47:04,985 INFO L378 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 163 treesize of output 159 [2024-11-14 03:47:04,993 INFO L378 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 159 treesize of output 147 [2024-11-14 03:47:05,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:47:05,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:47:05,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 178 [2024-11-14 03:47:05,049 INFO L378 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 127 treesize of output 123 [2024-11-14 03:47:05,065 INFO L378 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 123 treesize of output 119 [2024-11-14 03:47:05,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:47:05,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:47:05,167 INFO L378 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 31 treesize of output 11 [2024-11-14 03:47:05,176 INFO L378 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 8 treesize of output 6 [2024-11-14 03:47:05,182 INFO L378 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 8 treesize of output 4 [2024-11-14 03:47:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:47:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360063685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:47:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1455921116] [2024-11-14 03:47:05,239 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-14 03:47:05,241 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:47:05,242 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:47:05,242 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:47:05,242 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:47:06,250 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 23 for LOIs [2024-11-14 03:47:06,258 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:48:08,863 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7008#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_1|) 1) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_1|) 8) 1)) (not (= |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_1| 0)) (<= 12 (select |#length| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_1|)))))' at error location [2024-11-14 03:48:08,863 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:48:08,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:48:08,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 24 [2024-11-14 03:48:08,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192162535] [2024-11-14 03:48:08,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:48:08,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 03:48:08,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:48:08,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 03:48:08,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1428, Unknown=29, NotChecked=324, Total=1980 [2024-11-14 03:48:08,866 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:48:09,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~end~0#1.offset| 8)) 1) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_15| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_15|) 0)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_950) |v_ULTIMATE.start_main_#t~malloc3#1.base_15| v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= v_ArrVal_950 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_950 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_15|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) 8) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (or (not .cse2) (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_arrayElimCell_26 Int) (v_ArrVal_950 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_952) v_arrayElimCell_26 v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= v_ArrVal_950 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_950 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (or (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_950) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (not (= v_ArrVal_950 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_950 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) .cse2) (forall ((v_ArrVal_950 (Array Int Int))) (or (forall ((v_ArrVal_955 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_950))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (forall ((v_ArrVal_952 (Array Int Int)) (v_arrayElimCell_26 Int)) (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_952) v_arrayElimCell_26 v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (not (= v_ArrVal_950 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_950 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_15| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_15|) 0)) (forall ((v_ArrVal_950 (Array Int Int))) (or (forall ((v_ArrVal_955 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_950))) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_arrayElimCell_26 Int)) (= (select (select (store (store .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_15| v_ArrVal_952) v_arrayElimCell_26 v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store .cse4 |v_ULTIMATE.start_main_#t~malloc3#1.base_15| v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (not (= v_ArrVal_950 (store .cse0 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_950 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) (or (forall ((v_ArrVal_952 (Array Int Int)) (v_ArrVal_955 (Array Int Int)) (v_arrayElimCell_26 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_952) v_arrayElimCell_26 v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~end~0#1.base|) 0))))) is different from false [2024-11-14 03:48:09,945 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_952 (Array Int Int)) (v_ArrVal_955 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_952) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_953) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_955)) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_953 (Array Int Int)) (v_ArrVal_952 (Array Int Int)) (v_ArrVal_955 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_952) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_953) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_955) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) is different from false [2024-11-14 03:48:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:48:11,116 INFO L93 Difference]: Finished difference Result 275 states and 309 transitions. [2024-11-14 03:48:11,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 03:48:11,116 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 03:48:11,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:48:11,118 INFO L225 Difference]: With dead ends: 275 [2024-11-14 03:48:11,118 INFO L226 Difference]: Without dead ends: 275 [2024-11-14 03:48:11,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 56 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 64.1s TimeCoverageRelationStatistics Valid=370, Invalid=2483, Unknown=33, NotChecked=654, Total=3540 [2024-11-14 03:48:11,122 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 514 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 36 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1188 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:48:11,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 522 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 776 Invalid, 5 Unknown, 1188 Unchecked, 1.4s Time] [2024-11-14 03:48:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-14 03:48:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 140. [2024-11-14 03:48:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 138 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:48:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2024-11-14 03:48:11,129 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 31 [2024-11-14 03:48:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:48:11,129 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2024-11-14 03:48:11,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.68) internal successors, (67), 24 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:48:11,129 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2024-11-14 03:48:11,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 03:48:11,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:48:11,131 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:48:11,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 03:48:11,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-14 03:48:11,335 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:48:11,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:48:11,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1390199665, now seen corresponding path program 1 times [2024-11-14 03:48:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:48:11,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157204334] [2024-11-14 03:48:11,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:48:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:48:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:48:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:48:12,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:48:12,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157204334] [2024-11-14 03:48:12,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157204334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:48:12,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314910383] [2024-11-14 03:48:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:48:12,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:48:12,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:48:12,206 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:48:12,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:48:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:48:12,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 03:48:12,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:48:12,388 INFO L378 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 [2024-11-14 03:48:12,531 INFO L378 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 8 treesize of output 1 [2024-11-14 03:48:12,554 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:48:12,554 INFO L378 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 [2024-11-14 03:48:12,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:48:12,650 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-14 03:48:12,841 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:48:12,841 INFO L378 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 50 treesize of output 45 [2024-11-14 03:48:12,852 INFO L378 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 24 treesize of output 11 [2024-11-14 03:48:12,960 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 03:48:12,960 INFO L378 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 16 treesize of output 15 [2024-11-14 03:48:12,986 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 03:48:12,986 INFO L378 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 33 treesize of output 24 [2024-11-14 03:48:13,103 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:48:13,104 INFO L378 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 50 treesize of output 45 [2024-11-14 03:48:13,119 INFO L378 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 24 treesize of output 11 [2024-11-14 03:48:13,573 INFO L378 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 [2024-11-14 03:48:13,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 03:48:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:48:13,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:48:14,367 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_143| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_143| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_143|) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1057) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1056) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|))))) (forall ((v_ArrVal_1057 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_143| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_143| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_143|) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1057) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|) 9))))) is different from false [2024-11-14 03:48:14,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_143| Int)) (or (< (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1057) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1056) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_143| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_143|))) (forall ((v_ArrVal_1057 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_143| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_143| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_143|) (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1057) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|))))))) is different from false [2024-11-14 03:48:14,522 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_143| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_143| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_143|) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1053))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1052) .cse0 v_ArrVal_1057) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|) 11) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1056) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|))))))) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_143| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_143| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_143|) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1052) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1053) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1057) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|)))))) is different from false [2024-11-14 03:48:14,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_143| Int)) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1052) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1053) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1057) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_143| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_143|))) (forall ((v_ArrVal_1057 (Array Int Int)) (v_ArrVal_1056 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_143| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_143| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_143|) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1053))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1052) .cse1 v_ArrVal_1057) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1056) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_143|))))))))) is different from false [2024-11-14 03:48:14,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:14,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-14 03:48:14,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:14,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-14 03:48:14,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-14 03:48:14,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:14,645 INFO L378 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 186 treesize of output 181 [2024-11-14 03:48:14,659 INFO L378 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 64 treesize of output 62 [2024-11-14 03:48:14,670 INFO L378 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 58 [2024-11-14 03:48:14,678 INFO L378 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 86 treesize of output 80 [2024-11-14 03:48:14,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:14,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-14 03:48:14,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:48:14,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-14 03:48:14,898 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:48:14,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:48:14,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:48:14,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:48:14,907 INFO L378 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 74 treesize of output 50 [2024-11-14 03:48:14,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:48:14,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:48:14,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:48:14,919 INFO L378 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 42 treesize of output 30 [2024-11-14 03:48:14,927 INFO L378 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 11 [2024-11-14 03:48:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:48:15,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314910383] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:48:15,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [646658094] [2024-11-14 03:48:15,330 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-14 03:48:15,330 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:48:15,331 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:48:15,331 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:48:15,331 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:48:16,284 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:49:18,242 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7711#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))' at error location [2024-11-14 03:49:18,242 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:49:18,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:49:18,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 31 [2024-11-14 03:49:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436564616] [2024-11-14 03:49:18,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:49:18,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 03:49:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:49:18,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 03:49:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2301, Unknown=19, NotChecked=404, Total=2970 [2024-11-14 03:49:18,244 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 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) [2024-11-14 03:49:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:49:20,799 INFO L93 Difference]: Finished difference Result 200 states and 226 transitions. [2024-11-14 03:49:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 03:49:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 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) Word has length 35 [2024-11-14 03:49:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:49:20,801 INFO L225 Difference]: With dead ends: 200 [2024-11-14 03:49:20,801 INFO L226 Difference]: Without dead ends: 200 [2024-11-14 03:49:20,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 65 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 64.1s TimeCoverageRelationStatistics Valid=426, Invalid=3477, Unknown=19, NotChecked=500, Total=4422 [2024-11-14 03:49:20,802 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 706 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 796 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:49:20,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 458 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1106 Invalid, 0 Unknown, 796 Unchecked, 1.7s Time] [2024-11-14 03:49:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-14 03:49:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2024-11-14 03:49:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.3312101910828025) internal successors, (209), 178 states have internal predecessors, (209), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:49:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 212 transitions. [2024-11-14 03:49:20,808 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 212 transitions. Word has length 35 [2024-11-14 03:49:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:49:20,808 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 212 transitions. [2024-11-14 03:49:20,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.3870967741935485) internal successors, (105), 32 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) [2024-11-14 03:49:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 212 transitions. [2024-11-14 03:49:20,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 03:49:20,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:49:20,809 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-14 03:49:20,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 03:49:21,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-14 03:49:21,010 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:49:21,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:49:21,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1390199664, now seen corresponding path program 1 times [2024-11-14 03:49:21,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:49:21,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661185201] [2024-11-14 03:49:21,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:49:21,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:49:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:49:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:49:21,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:49:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661185201] [2024-11-14 03:49:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661185201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:49:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260317012] [2024-11-14 03:49:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:49:21,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:49:21,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:49:21,718 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:49:21,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:49:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:49:21,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 03:49:21,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:49:21,908 INFO L378 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 [2024-11-14 03:49:22,077 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:49:22,077 INFO L378 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 [2024-11-14 03:49:22,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:49:22,375 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:49:22,376 INFO L378 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 34 treesize of output 33 [2024-11-14 03:49:22,475 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-14 03:49:22,475 INFO L378 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 33 treesize of output 24 [2024-11-14 03:49:22,524 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:49:22,525 INFO L378 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 34 treesize of output 33 [2024-11-14 03:49:22,853 INFO L378 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 [2024-11-14 03:49:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:49:22,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:49:23,445 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_155| Int)) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_155|) (< |v_ULTIMATE.start_main_~end~0#1.offset_155| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1153))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1155)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_155|)) 1))) is different from false [2024-11-14 03:49:23,463 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array Int Int)) (v_ArrVal_1153 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_155| Int)) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_155|) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1153))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1155)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_155|)) 1) (< |v_ULTIMATE.start_main_~end~0#1.offset_155| 0))) is different from false [2024-11-14 03:49:23,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:49:23,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-14 03:49:23,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:49:23,493 INFO L378 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 252 treesize of output 227 [2024-11-14 03:49:23,505 INFO L378 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 171 treesize of output 163 [2024-11-14 03:49:23,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:49:23,523 INFO L378 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 163 treesize of output 159 [2024-11-14 03:49:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:49:27,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260317012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:49:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [523896950] [2024-11-14 03:49:27,824 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2024-11-14 03:49:27,824 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:49:27,824 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:49:27,825 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:49:27,825 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:49:28,697 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:50:54,103 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8376#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~end~0#1.base_185| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~end~0#1.base_185|) 1))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))' at error location [2024-11-14 03:50:54,103 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:50:54,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:50:54,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 30 [2024-11-14 03:50:54,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681858540] [2024-11-14 03:50:54,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:50:54,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 03:50:54,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:50:54,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 03:50:54,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2428, Unknown=32, NotChecked=206, Total=2970 [2024-11-14 03:50:54,106 INFO L87 Difference]: Start difference. First operand 180 states and 212 transitions. Second operand has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:50:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:50:56,805 INFO L93 Difference]: Finished difference Result 224 states and 251 transitions. [2024-11-14 03:50:56,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-14 03:50:56,806 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 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 [2024-11-14 03:50:56,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:50:56,807 INFO L225 Difference]: With dead ends: 224 [2024-11-14 03:50:56,807 INFO L226 Difference]: Without dead ends: 224 [2024-11-14 03:50:56,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 88.1s TimeCoverageRelationStatistics Valid=403, Invalid=3113, Unknown=32, NotChecked=234, Total=3782 [2024-11-14 03:50:56,809 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 445 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:50:56,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 497 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1258 Invalid, 0 Unknown, 454 Unchecked, 2.2s Time] [2024-11-14 03:50:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-14 03:50:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 180. [2024-11-14 03:50:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 157 states have (on average 1.3184713375796178) internal successors, (207), 178 states have internal predecessors, (207), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:50:56,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2024-11-14 03:50:56,816 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 35 [2024-11-14 03:50:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:50:56,816 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2024-11-14 03:50:56,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.433333333333333) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:50:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2024-11-14 03:50:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:50:56,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:50:56,817 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:50:56,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 03:50:57,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-14 03:50:57,022 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:50:57,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:50:57,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1018506177, now seen corresponding path program 1 times [2024-11-14 03:50:57,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:50:57,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35104037] [2024-11-14 03:50:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:50:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:50:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:50:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:50:57,136 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:50:57,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35104037] [2024-11-14 03:50:57,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35104037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:50:57,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:50:57,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:50:57,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851957704] [2024-11-14 03:50:57,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:50:57,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:50:57,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:50:57,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:50:57,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:50:57,138 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:50:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:50:57,456 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2024-11-14 03:50:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:50:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-14 03:50:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:50:57,458 INFO L225 Difference]: With dead ends: 173 [2024-11-14 03:50:57,458 INFO L226 Difference]: Without dead ends: 173 [2024-11-14 03:50:57,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:50:57,459 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:50:57,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 201 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:50:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-14 03:50:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-14 03:50:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 171 states have internal predecessors, (196), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:50:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 199 transitions. [2024-11-14 03:50:57,469 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 199 transitions. Word has length 37 [2024-11-14 03:50:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:50:57,469 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 199 transitions. [2024-11-14 03:50:57,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:50:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2024-11-14 03:50:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:50:57,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:50:57,470 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:50:57,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-14 03:50:57,470 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2024-11-14 03:50:57,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:50:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2042153863, now seen corresponding path program 1 times [2024-11-14 03:50:57,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:50:57,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228506334] [2024-11-14 03:50:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:50:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:50:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:50:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:50:58,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:50:58,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228506334] [2024-11-14 03:50:58,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228506334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:50:58,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248929656] [2024-11-14 03:50:58,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:50:58,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:50:58,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:50:58,642 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:50:58,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_068e14fb-9865-4674-8a89-aec788780b87/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:50:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:50:58,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 03:50:58,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:50:58,859 INFO L378 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 [2024-11-14 03:50:58,925 INFO L378 Elim1Store]: Elim1 eliminated variable 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 [2024-11-14 03:50:59,018 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:50:59,018 INFO L378 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 [2024-11-14 03:50:59,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:50:59,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:50:59,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:50:59,284 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:50:59,285 INFO L378 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 41 treesize of output 38 [2024-11-14 03:50:59,294 INFO L378 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 24 treesize of output 11 [2024-11-14 03:50:59,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-14 03:50:59,378 INFO L378 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 16 treesize of output 11 [2024-11-14 03:50:59,496 INFO L378 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 16 treesize of output 11 [2024-11-14 03:50:59,543 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-14 03:50:59,543 INFO L378 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 16 treesize of output 18 [2024-11-14 03:50:59,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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 [2024-11-14 03:50:59,640 INFO L378 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 16 treesize of output 11 [2024-11-14 03:50:59,894 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:50:59,894 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2024-11-14 03:50:59,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-14 03:50:59,950 INFO L378 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 24 treesize of output 12 [2024-11-14 03:51:00,029 INFO L378 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 16 treesize of output 11 [2024-11-14 03:51:00,042 INFO L378 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 16 treesize of output 11 [2024-11-14 03:51:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:51:00,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:51:00,433 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1357) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1358) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-14 03:51:00,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1358 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1357) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1358) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1360)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-11-14 03:51:00,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:51:00,454 INFO L378 Elim1Store]: Elim1 eliminated variable 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 33 treesize of output 34 [2024-11-14 03:51:00,457 INFO L378 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 60 treesize of output 52 [2024-11-14 03:51:00,463 INFO L378 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 24 treesize of output 22 [2024-11-14 03:51:03,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:51:03,662 INFO L378 Elim1Store]: Elim1 eliminated variable 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 168 treesize of output 137 [2024-11-14 03:51:03,675 INFO L378 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 257 treesize of output 233 [2024-11-14 03:51:03,689 INFO L378 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 219 treesize of output 213 [2024-11-14 03:51:04,091 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2024-11-14 03:51:04,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 220 treesize of output 330 [2024-11-14 03:51:04,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 218 [2024-11-14 03:51:33,347 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse9 (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_ArrVal_1355 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1360 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) (.cse12 (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27))) (or (= (select (select (store (store .cse51 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse51 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))))))) (.cse0 (not .cse7))) (and (or .cse0 (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1350 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27))) (or (= (select (select (store (store .cse1 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse1 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse3 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86)))))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27))) (or (= (select (select (store (store .cse5 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store (store .cse6 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse5 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or .cse0 (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1355 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1350 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_93) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) (or .cse7 (and (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_arrayElimCell_93 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_93) (forall ((v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1351 (Array Int Int))) (= (select (select (store (store (store .cse8 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))))))) .cse9)) (or .cse0 (and (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_30 v_arrayElimCell_86)))))))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27))) (or (= (select (select (store (store .cse11 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse11 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_30 v_arrayElimCell_86)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) (or (and .cse12 (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (let ((.cse13 (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27))) (or (= (select (select (store .cse13 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse14 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int))) (= (select (select (store (store .cse13 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse15 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse7) (or .cse7 (and (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse16 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))))) .cse12 (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27))) (or (= (select (select (store (store .cse17 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse17 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))))))) (or .cse0 (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1355 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1350 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_93) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) (or (and .cse12 (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (let ((.cse19 (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27))) (or (= (select (select (store .cse19 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse20 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int))) (= (select (select (store (store .cse19 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse21 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse7) (or .cse0 (and (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store (store .cse22 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86)))))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27))) (or (= (select (select (store (store .cse23 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse23 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) (or .cse7 (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1350 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))))) (or .cse0 (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1355 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1351 (Array Int Int)) (v_ArrVal_1350 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (or (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_93) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1360 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_93) (= (select (select (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1360 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_93) (= (select (select (store (store .cse26 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (or (and .cse9 (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (forall ((v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1351 (Array Int Int))) (= (select (select (store (store (store .cse27 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|))))))) .cse7) (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (let ((.cse28 (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27))) (or (= (select (select (store .cse28 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse29 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int))) (= (select (select (store (store .cse28 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (= v_prenex_30 v_arrayElimCell_86))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (let ((.cse30 (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27))) (or (= (select (select (store (store .cse30 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse30 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= v_prenex_30 v_arrayElimCell_86))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))))) (or .cse0 (and (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_86 Int)) (or (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86) (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27))) (or (= (select (select (store (store .cse32 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse32 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30))))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int))) (= (select (select (store (store (store .cse33 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))))))))) (or .cse7 (and .cse9 (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1360 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93))))))) (or .cse7 (and (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int)) (or (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93) (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_93) (forall ((v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_ArrVal_1351 (Array Int Int))) (= (select (select (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|))))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) .cse9)) (or .cse7 (and (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1360 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store .cse36 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_93) (= (select (select (store (store .cse36 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) .cse9)) (or .cse0 (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1350 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (let ((.cse37 (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27))) (or (= (select (select (store (store .cse37 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse37 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30)))))) (or .cse7 (and (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1360 (Array Int Int))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))))) .cse9)) (or .cse7 (and .cse9 (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_arrayElimCell_93 Int)) (or (forall ((v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1360 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store .cse40 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_93) (= (select (select (store (store .cse40 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_93) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93))))))) (or .cse7 (and (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store (store .cse41 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse41 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86)))) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))))) .cse12 (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_prenex_30 Int)) (or (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (let ((.cse42 (store .cse43 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27))) (or (= (select (select (store (store .cse42 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store (store .cse43 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse42 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))))) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_arrayElimCell_93 Int) (v_ArrVal_1355 (Array Int Int)) (v_ArrVal_1351 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1360 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1351) v_arrayElimCell_93 v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_arrayElimCell_93) (= (select (select (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_93) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))))) (or .cse7 (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1350 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_arrayElimCell_86 Int) (v_prenex_27 (Array Int Int))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (= (select (select (store (store (store (store .cse45 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store (store .cse45 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))))) (or .cse7 (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_30 Int) (v_ArrVal_1350 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27))) (or (= (select (select (store (store .cse46 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse46 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|))))) (or (and (forall ((v_ArrVal_1350 (Array Int Int))) (or (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_86 Int)) (or (= v_prenex_30 v_arrayElimCell_86) (forall ((v_arrayElimCell_84 Int) (v_prenex_31 (Array Int Int)) (v_ArrVal_1357 (Array Int Int)) (v_prenex_29 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27))) (or (= (select (select (store (store .cse47 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= (select (select (store .cse47 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30))) (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (or (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse48 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int))) (= (select (select (store (store (store .cse48 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27) v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1))))) (= v_prenex_30 v_arrayElimCell_86))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30)))))) .cse0) (or .cse7 (forall ((v_ArrVal_1355 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_17| Int) (v_ArrVal_1350 (Array Int Int)) (v_ArrVal_1360 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1355) |v_ULTIMATE.start_main_#t~malloc7#1.base_17| v_ArrVal_1360) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_17| |c_ULTIMATE.start_main_~end~0#1.base|)))) (forall ((v_ArrVal_1350 (Array Int Int))) (or (not (= v_ArrVal_1350 (store .cse4 |c_ULTIMATE.start_main_~end~0#1.offset| (select v_ArrVal_1350 |c_ULTIMATE.start_main_~end~0#1.offset|)))) (forall ((v_prenex_30 Int)) (or (forall ((v_arrayElimCell_86 Int)) (or (forall ((v_prenex_31 (Array Int Int)) (v_prenex_27 (Array Int Int))) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1350))) (let ((.cse49 (store .cse50 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_27))) (or (= (select (select (store .cse49 v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1) (forall ((v_prenex_29 (Array Int Int))) (= (select (select (store (store (store .cse50 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_29) v_arrayElimCell_86 v_prenex_27) v_prenex_30 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)) (forall ((v_arrayElimCell_84 Int) (v_ArrVal_1357 (Array Int Int))) (= (select (select (store (store .cse49 v_prenex_30 v_ArrVal_1357) v_arrayElimCell_84 v_prenex_31) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) 1)))))) (= v_prenex_30 v_arrayElimCell_86) (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_86))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_30) (= v_prenex_30 |c_ULTIMATE.start_main_~end~0#1.base|)))))))) is different from false [2024-11-14 03:51:58,437 INFO L378 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 30879 treesize of output 30823 [2024-11-14 03:51:58,634 INFO L378 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 2287 treesize of output 2279 [2024-11-14 03:51:58,692 INFO L378 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 2279 treesize of output 2271 [2024-11-14 03:51:58,729 INFO L378 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 2271 treesize of output 2267 [2024-11-14 03:51:58,767 INFO L378 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 2267 treesize of output 2259 [2024-11-14 03:51:58,804 INFO L378 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 2259 treesize of output 2251 [2024-11-14 03:51:58,849 INFO L378 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 2251 treesize of output 2247 [2024-11-14 03:51:58,902 INFO L378 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 2247 treesize of output 2243 [2024-11-14 03:51:58,951 INFO L378 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 2243 treesize of output 2239 [2024-11-14 03:51:58,993 INFO L378 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 2239 treesize of output 2235 [2024-11-14 03:51:59,032 INFO L378 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 2235 treesize of output 2231 [2024-11-14 03:51:59,096 INFO L378 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 2231 treesize of output 2227 [2024-11-14 03:51:59,134 INFO L378 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 2227 treesize of output 2223 [2024-11-14 03:51:59,174 INFO L378 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 2223 treesize of output 2219 [2024-11-14 03:51:59,218 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:52:01,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:52:01,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 28 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 28 new quantified variables, introduced 56 case distinctions, treesize of input 2219 treesize of output 9192 [2024-11-14 03:52:04,078 INFO L378 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 1939 treesize of output 1923 [2024-11-14 03:52:05,423 INFO L378 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 1923 treesize of output 1915 [2024-11-14 03:52:06,980 INFO L378 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 1915 treesize of output 1911 [2024-11-14 03:52:08,376 INFO L378 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 1911 treesize of output 1907 [2024-11-14 03:52:09,944 INFO L378 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 1907 treesize of output 1899 [2024-11-14 03:52:11,140 INFO L378 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 1899 treesize of output 1883 [2024-11-14 03:52:12,406 INFO L378 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 1883 treesize of output 1879 [2024-11-14 03:52:13,479 INFO L378 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 1879 treesize of output 1875 [2024-11-14 03:52:14,785 INFO L378 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 1875 treesize of output 1871 [2024-11-14 03:52:15,974 INFO L378 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 1871 treesize of output 1867 [2024-11-14 03:52:17,152 INFO L378 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 1867 treesize of output 1863 [2024-11-14 03:52:18,510 INFO L378 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 1863 treesize of output 1859 [2024-11-14 03:52:19,876 INFO L378 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 1859 treesize of output 1855 [2024-11-14 03:52:21,027 INFO L378 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 1855 treesize of output 1847 [2024-11-14 03:52:22,243 INFO L378 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 1847 treesize of output 1843 [2024-11-14 03:52:23,396 INFO L378 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 1843 treesize of output 1839 [2024-11-14 03:52:24,655 INFO L378 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 1839 treesize of output 1835 [2024-11-14 03:52:26,107 INFO L378 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 1835 treesize of output 1831 [2024-11-14 03:52:27,408 INFO L378 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 1831 treesize of output 1823 [2024-11-14 03:52:28,646 INFO L378 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 1823 treesize of output 1819 [2024-11-14 03:52:29,996 INFO L378 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 1819 treesize of output 1815 [2024-11-14 03:52:31,413 INFO L378 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 1815 treesize of output 1811 [2024-11-14 03:52:32,730 INFO L378 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 1811 treesize of output 1807 [2024-11-14 03:52:34,340 INFO L378 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 1807 treesize of output 1799 [2024-11-14 03:52:35,682 INFO L378 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 1799 treesize of output 1791 [2024-11-14 03:52:36,867 INFO L378 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 1791 treesize of output 1787 [2024-11-14 03:52:38,284 INFO L378 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 1787 treesize of output 1779 [2024-11-14 03:52:39,848 INFO L378 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 1779 treesize of output 1775 [2024-11-14 03:52:41,252 INFO L378 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 1775 treesize of output 1771 [2024-11-14 03:52:42,447 INFO L378 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 1771 treesize of output 1767 [2024-11-14 03:52:43,656 INFO L378 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 1767 treesize of output 1763 [2024-11-14 03:52:44,892 INFO L378 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 1763 treesize of output 1759 [2024-11-14 03:52:46,047 INFO L378 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 1759 treesize of output 1751 [2024-11-14 03:52:47,288 INFO L378 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 1751 treesize of output 1743 [2024-11-14 03:52:48,504 INFO L378 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 1743 treesize of output 1739 [2024-11-14 03:52:49,926 INFO L378 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 1739 treesize of output 1727 [2024-11-14 03:52:51,181 INFO L378 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 1727 treesize of output 1723 [2024-11-14 03:52:52,443 INFO L378 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 1723 treesize of output 1719 [2024-11-14 03:52:59,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:52:59,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:53:02,636 INFO L224 Elim1Store]: Index analysis took 2671 ms [2024-11-14 03:53:02,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:53:02,854 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-11-14 03:53:02,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 25 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 637 treesize of output 6297 [2024-11-14 03:53:09,821 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:53:09,825 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:53:09,830 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:53:09,831 INFO L378 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 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-14 03:53:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:53:12,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248929656] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:53:12,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1778969680] [2024-11-14 03:53:12,195 INFO L159 IcfgInterpreter]: Started Sifa with 36 locations of interest [2024-11-14 03:53:12,195 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:53:12,195 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:53:12,195 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:53:12,196 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:53:14,358 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 23 for LOIs [2024-11-14 03:53:14,364 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:55:39,330 WARN L286 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 187 DAG size of output: 170 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:56:17,123 WARN L286 SmtUtils]: Spent 10.96s on a formula simplification. DAG size of input: 198 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:56:43,988 WARN L286 SmtUtils]: Spent 11.43s on a formula simplification. DAG size of input: 202 DAG size of output: 180 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:57:13,804 WARN L286 SmtUtils]: Spent 9.87s on a formula simplification. DAG size of input: 201 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:57:43,369 WARN L286 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 207 DAG size of output: 182 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:58:19,900 WARN L286 SmtUtils]: Spent 9.64s on a formula simplification. DAG size of input: 205 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:59:03,018 WARN L286 SmtUtils]: Spent 14.31s on a formula simplification. DAG size of input: 210 DAG size of output: 176 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 03:59:06,777 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9432#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_2|) 1) (<= 12 (select |#length| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_2|)) (not (= |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_2| 0)) (not (= (select (select |#memory_int| |v_ULTIMATE.start_main_~list~0#1.base_BEFORE_CALL_2|) 8) 1)))))' at error location [2024-11-14 03:59:06,777 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:59:06,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:59:06,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 43 [2024-11-14 03:59:06,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692108422] [2024-11-14 03:59:06,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:59:06,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-14 03:59:06,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:59:06,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-14 03:59:06,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=4187, Unknown=145, NotChecked=408, Total=5112 [2024-11-14 03:59:06,782 INFO L87 Difference]: Start difference. First operand 173 states and 199 transitions. Second operand has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 43 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:59:08,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:59:10,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:59:15,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:59:17,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:59:20,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:59:26,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:59:31,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:59:33,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:59:35,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:59:38,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]