./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje --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 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:23:26,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:23:26,998 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 01:23:27,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:23:27,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:23:27,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:23:27,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:23:27,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:23:27,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:23:27,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:23:27,051 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:23:27,052 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:23:27,052 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:23:27,056 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:23:27,056 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:23:27,057 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:23:27,057 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:23:27,058 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:23:27,058 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:23:27,059 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:23:27,059 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:23:27,064 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:23:27,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:23:27,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:23:27,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:23:27,067 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:23:27,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:23:27,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:23:27,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:23:27,070 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 01:23:27,071 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 01:23:27,071 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 01:23:27,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:23:27,072 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:23:27,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:23:27,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 01:23:27,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:23:27,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:23:27,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:23:27,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:23:27,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:23:27,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:23:27,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:23:27,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:23:27,078 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:23:27,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:23:27,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:23:27,080 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:23:27,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:23:27,080 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje 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 -> 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 [2024-11-09 01:23:27,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:23:27,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:23:27,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:23:27,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:23:27,522 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:23:27,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i Unable to find full path for "g++" [2024-11-09 01:23:30,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:23:30,525 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:23:30,526 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2024-11-09 01:23:30,543 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/data/4742d2fa1/22429e6c31704a0592ed7dcf0d728bff/FLAG554b7b1cf [2024-11-09 01:23:30,710 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/data/4742d2fa1/22429e6c31704a0592ed7dcf0d728bff [2024-11-09 01:23:30,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:23:30,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:23:30,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:23:30,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:23:30,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:23:30,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:23:30" (1/1) ... [2024-11-09 01:23:30,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68adc343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:30, skipping insertion in model container [2024-11-09 01:23:30,732 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:23:30" (1/1) ... [2024-11-09 01:23:30,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:23:31,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:23:31,374 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:23:31,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:23:31,485 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:23:31,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31 WrapperNode [2024-11-09 01:23:31,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:23:31,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:23:31,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:23:31,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:23:31,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,524 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,564 INFO L138 Inliner]: procedures = 122, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2024-11-09 01:23:31,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:23:31,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:23:31,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:23:31,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:23:31,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:23:31,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:23:31,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:23:31,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:23:31,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (1/1) ... [2024-11-09 01:23:31,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:23:31,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:23:31,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:23:31,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:23:31,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:23:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:23:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 01:23:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:23:31,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 01:23:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 01:23:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:23:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:23:31,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:23:31,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:23:31,911 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:23:31,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:23:32,361 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-11-09 01:23:32,361 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:23:32,423 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:23:32,424 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:23:32,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:32 BoogieIcfgContainer [2024-11-09 01:23:32,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:23:32,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:23:32,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:23:32,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:23:32,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:23:30" (1/3) ... [2024-11-09 01:23:32,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa880f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:23:32, skipping insertion in model container [2024-11-09 01:23:32,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:23:31" (2/3) ... [2024-11-09 01:23:32,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa880f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:23:32, skipping insertion in model container [2024-11-09 01:23:32,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:23:32" (3/3) ... [2024-11-09 01:23:32,437 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2024-11-09 01:23:32,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:23:32,463 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-11-09 01:23:32,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:23:32,546 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;@69ada608, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:23:32,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-09 01:23:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 78 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 01:23:32,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:32,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 01:23:32,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:23:32,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash 6155910, now seen corresponding path program 1 times [2024-11-09 01:23:32,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:23:32,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228707669] [2024-11-09 01:23:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:32,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:32,843 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-09 01:23:32,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:23:32,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228707669] [2024-11-09 01:23:32,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228707669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:32,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:32,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:23:32,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039283746] [2024-11-09 01:23:32,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:32,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:32,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:23:32,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:32,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:32,925 INFO L87 Difference]: Start difference. First operand has 79 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 78 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 01:23:33,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:33,064 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2024-11-09 01:23:33,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:33,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-09 01:23:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:33,079 INFO L225 Difference]: With dead ends: 102 [2024-11-09 01:23:33,079 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 01:23:33,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:33,086 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 25 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:33,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 148 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:23:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 01:23:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2024-11-09 01:23:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 2.046511627906977) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:33,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-11-09 01:23:33,152 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2024-11-09 01:23:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:33,154 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-11-09 01:23:33,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-09 01:23:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-11-09 01:23:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 01:23:33,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:33,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 01:23:33,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:23:33,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:23:33,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:33,159 INFO L85 PathProgramCache]: Analyzing trace with hash 189511669, now seen corresponding path program 1 times [2024-11-09 01:23:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:23:33,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750372982] [2024-11-09 01:23:33,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:33,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,344 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-09 01:23:33,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:23:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750372982] [2024-11-09 01:23:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750372982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:33,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:33,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:23:33,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81617844] [2024-11-09 01:23:33,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:33,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:33,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:23:33,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:33,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:33,350 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:33,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:33,481 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-11-09 01:23:33,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:33,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 01:23:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:33,484 INFO L225 Difference]: With dead ends: 73 [2024-11-09 01:23:33,485 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 01:23:33,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:33,487 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:33,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 97 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:23:33,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 01:23:33,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-09 01:23:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.930232558139535) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2024-11-09 01:23:33,497 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 5 [2024-11-09 01:23:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:33,498 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2024-11-09 01:23:33,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2024-11-09 01:23:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 01:23:33,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:33,499 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 01:23:33,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:23:33,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:23:33,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:33,501 INFO L85 PathProgramCache]: Analyzing trace with hash 189511670, now seen corresponding path program 1 times [2024-11-09 01:23:33,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:23:33,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564451086] [2024-11-09 01:23:33,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,704 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-09 01:23:33,704 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:23:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564451086] [2024-11-09 01:23:33,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564451086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:33,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:33,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:23:33,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279702464] [2024-11-09 01:23:33,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:33,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:33,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:23:33,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:33,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:33,708 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:33,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:33,839 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2024-11-09 01:23:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 01:23:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:33,845 INFO L225 Difference]: With dead ends: 68 [2024-11-09 01:23:33,845 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 01:23:33,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:33,847 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 10 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:33,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 100 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:23:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 01:23:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-09 01:23:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.813953488372093) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-11-09 01:23:33,867 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 5 [2024-11-09 01:23:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:33,867 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-11-09 01:23:33,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:23:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-11-09 01:23:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:23:33,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:33,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:23:33,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:23:33,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:23:33,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:33,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1305415036, now seen corresponding path program 1 times [2024-11-09 01:23:33,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:23:33,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002680917] [2024-11-09 01:23:33,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:33,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:33,985 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-09 01:23:33,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:23:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002680917] [2024-11-09 01:23:33,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002680917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:23:33,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:23:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:23:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766351713] [2024-11-09 01:23:33,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:23:33,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 01:23:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:23:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 01:23:33,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:33,989 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-09 01:23:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:23:34,055 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2024-11-09 01:23:34,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 01:23:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-09 01:23:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:23:34,058 INFO L225 Difference]: With dead ends: 75 [2024-11-09 01:23:34,058 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 01:23:34,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 01:23:34,064 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:23:34,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:23:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 01:23:34,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 01:23:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.7) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 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-09 01:23:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-11-09 01:23:34,077 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 11 [2024-11-09 01:23:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:23:34,078 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-09 01:23:34,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-09 01:23:34,079 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-09 01:23:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 01:23:34,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:23:34,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:23:34,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:23:34,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:23:34,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:23:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1304712489, now seen corresponding path program 1 times [2024-11-09 01:23:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:23:34,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30217294] [2024-11-09 01:23:34,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:23:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,272 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-09 01:23:34,272 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:23:34,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30217294] [2024-11-09 01:23:34,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30217294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:23:34,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374959233] [2024-11-09 01:23:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:23:34,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:23:34,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:23:34,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:23:34,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:23:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:23:34,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 01:23:34,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:23:34,519 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-09 01:23:34,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:23:34,584 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-09 01:23:34,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374959233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:23:34,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1445464149] [2024-11-09 01:23:34,618 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-09 01:23:34,618 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:23:34,625 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:23:34,633 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:23:34,633 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:23:37,274 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:24:02,162 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 204 DAG size of output: 195 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:24:39,194 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 250 DAG size of output: 244 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:25:05,349 WARN L286 SmtUtils]: Spent 11.94s on a formula simplification. DAG size of input: 258 DAG size of output: 252 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:25:10,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1445464149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:25:10,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:25:10,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [3, 3, 3] total 13 [2024-11-09 01:25:10,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580876074] [2024-11-09 01:25:10,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:25:10,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:25:10,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:25:10,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:25:10,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=101, Unknown=25, NotChecked=0, Total=182 [2024-11-09 01:25:10,991 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:25:12,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:14,911 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-09 01:25:16,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:18,998 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-09 01:25:21,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:23,480 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-09 01:25:25,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:27,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:29,611 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 [0] [2024-11-09 01:25:31,747 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-09 01:25:34,139 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-09 01:25:36,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:38,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:40,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:43,444 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-09 01:25:45,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:47,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:49,547 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-09 01:25:51,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:25:54,555 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-09 01:25:56,569 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-09 01:25:58,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:00,851 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-09 01:26:02,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:04,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:06,914 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-09 01:26:08,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:11,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:13,126 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-09 01:26:15,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:17,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:20,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:24,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:26,564 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-09 01:26:29,071 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-09 01:26:31,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:26:37,450 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-09 01:26:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:26:40,088 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2024-11-09 01:26:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 01:26:40,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 01:26:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:26:40,090 INFO L225 Difference]: With dead ends: 86 [2024-11-09 01:26:40,090 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 01:26:40,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 93.7s TimeCoverageRelationStatistics Valid=56, Invalid=101, Unknown=25, NotChecked=0, Total=182 [2024-11-09 01:26:40,091 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 1 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:26:40,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 261 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 422 Invalid, 35 Unknown, 0 Unchecked, 89.0s Time] [2024-11-09 01:26:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 01:26:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-09 01:26:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.6) internal successors, (96), 84 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:26:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-11-09 01:26:40,103 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 14 [2024-11-09 01:26:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:26:40,104 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-11-09 01:26:40,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:26:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-11-09 01:26:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 01:26:40,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:26:40,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 01:26:40,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:26:40,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:40,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:26:40,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:26:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1954874379, now seen corresponding path program 1 times [2024-11-09 01:26:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:26:40,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640467855] [2024-11-09 01:26:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:40,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:26:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:26:40,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:26:40,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640467855] [2024-11-09 01:26:40,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640467855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:26:40,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072009745] [2024-11-09 01:26:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:26:40,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:26:40,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:26:40,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:26:40,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:26:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:26:40,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 01:26:40,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:26:40,946 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-09 01:26:41,108 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 01:26:41,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 01:26:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:26:41,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:26:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:26:41,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072009745] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:26:41,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [446271811] [2024-11-09 01:26:41,401 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-09 01:26:41,401 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:26:41,401 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:26:41,402 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:26:41,402 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:26:43,856 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:27:08,544 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 204 DAG size of output: 195 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:27:45,609 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 250 DAG size of output: 244 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:28:16,176 WARN L286 SmtUtils]: Spent 14.76s on a formula simplification. DAG size of input: 258 DAG size of output: 252 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:28:43,141 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 197 DAG size of output: 193 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:28:43,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [446271811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:28:43,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:28:43,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 3, 3] total 14 [2024-11-09 01:28:43,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695989541] [2024-11-09 01:28:43,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:28:43,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 01:28:43,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:28:43,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 01:28:43,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=140, Unknown=31, NotChecked=0, Total=210 [2024-11-09 01:28:43,145 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:28:46,230 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-09 01:28:48,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:28:50,400 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-09 01:28:52,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:28:54,942 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-09 01:28:57,885 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-09 01:28:59,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:03,484 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-09 01:29:05,741 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 [0] [2024-11-09 01:29:07,757 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-09 01:29:10,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:12,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:15,038 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-09 01:29:17,478 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 [0] [2024-11-09 01:29:19,491 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-09 01:29:21,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:23,604 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-09 01:29:25,620 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 [0] [2024-11-09 01:29:26,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:28,701 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-09 01:29:31,324 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 [0] [2024-11-09 01:29:33,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:34,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:36,570 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-09 01:29:38,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:40,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:41,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:44,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:46,098 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-09 01:29:48,943 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-09 01:29:51,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:53,560 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-09 01:29:55,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:57,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:29:58,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:30:01,214 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse36 (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse55 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1))) (let ((.cse0 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_create_~len#1| 4)) (.cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse3 (= |c_#valid| (store .cse55 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1))) (.cse4 (= (select .cse55 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)) (.cse5 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse6 (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse18 (exists ((|v_#length_59| (Array Int Int))) (and (= 2 (select |v_#length_59| 1)) (= (store (store |v_#length_59| |c_ULTIMATE.start_dll_create_~head~0#1.base| 20) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 20) |c_#length|) (= (select |v_#length_59| 2) 18)))) (.cse26 (not .cse36)) (.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12)) (.cse47 (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|)) (.cse37 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse38 (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))) (and .cse0 .cse1 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) .cse2 .cse3 (<= 1 |c_#StackHeapBarrier|) .cse4 .cse5 .cse6 (exists ((|v_#memory_int_66| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int))) (|v_#memory_int_70| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (let ((.cse9 (select |v_#memory_int_66| 1)) (.cse10 (select |v_#memory_int_70| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select |v_#memory_int_80| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (store |v_#memory_int_80| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse7 12 .cse8)) |c_#memory_int|) (= (select .cse9 1) 0) (= 48 (select .cse9 0)) (= (store |v_#memory_int_70| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse10 12 (select (select |v_#memory_int_71| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12))) |v_#memory_int_71|) (= (store |v_#memory_int_66| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store (store (store (select |v_#memory_int_66| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse10 4))) |v_#memory_int_70|) (= (store |v_#memory_int_71| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (store (select |v_#memory_int_71| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse7 4))) |v_#memory_int_80|)))) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_58| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_$Pointer$.base_65| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse14 (select |v_#memory_$Pointer$.base_55| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse17 (select |v_#memory_$Pointer$.base_58| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse12 (select |v_#memory_$Pointer$.base_59| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse15 (select |v_#memory_$Pointer$.base_53| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse13 (select |v_#memory_$Pointer$.base_54| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_65| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse11 4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12 0))) (= (store |v_#memory_$Pointer$.base_59| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse12 16 (select .cse11 16))) |v_#memory_$Pointer$.base_65|) (= (store |v_#memory_$Pointer$.base_54| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse13 16 (select .cse14 16))) |v_#memory_$Pointer$.base_55|) (= (store |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse15 0))) |v_#memory_$Pointer$.base_53|) (= (let ((.cse16 (store |v_#memory_$Pointer$.base_55| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse14 4 0) 12 0)))) (store .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse17 0)))) |v_#memory_$Pointer$.base_58|) (= |v_#memory_$Pointer$.base_59| (store |v_#memory_$Pointer$.base_58| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse17 8 (select .cse12 8)))) (= (store |v_#memory_$Pointer$.base_53| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse15 8 (select .cse13 8))) |v_#memory_$Pointer$.base_54|)))) .cse18 (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_59| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_58| (Array Int (Array Int Int)))) (let ((.cse19 (select |v_#memory_$Pointer$.offset_58| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse23 (select |v_#memory_$Pointer$.offset_55| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse20 (select |v_#memory_$Pointer$.offset_59| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse21 (select |v_#memory_$Pointer$.offset_65| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse25 (select |v_#memory_$Pointer$.offset_53| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse24 (select |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_58| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse19 8 (select .cse20 8))) |v_#memory_$Pointer$.offset_59|) (= (store |v_#memory_$Pointer$.offset_65| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse21 4 0) 12 0)) |c_#memory_$Pointer$.offset|) (= (let ((.cse22 (store |v_#memory_$Pointer$.offset_55| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse23 4 0) 12 0)))) (store .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse19 0)))) |v_#memory_$Pointer$.offset_58|) (= (store |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse24 16 (select .cse23 16))) |v_#memory_$Pointer$.offset_55|) (= (store |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse25 0))) |v_#memory_$Pointer$.offset_53|) (= (store |v_#memory_$Pointer$.offset_59| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse20 16 (select .cse21 16))) |v_#memory_$Pointer$.offset_65|) (= (store |v_#memory_$Pointer$.offset_53| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse25 8 (select .cse24 8))) |v_#memory_$Pointer$.offset_54|)))) .cse26 (exists ((|v_#memory_$Pointer$.base_65| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_65| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (let ((.cse28 (select |v_#memory_$Pointer$.offset_65| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse27 (select |v_#memory_$Pointer$.base_65| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse54 (select |v_#memory_int_80| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_65| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse27 4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12 0))) (= (store |v_#memory_$Pointer$.offset_65| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse28 4 0) 12 0)) |c_#memory_$Pointer$.offset|) (let ((.cse30 (select .cse27 16)) (.cse34 (select .cse28 16))) (or (and (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_$Pointer$.base_53| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse29 (select |v_#memory_$Pointer$.base_54| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_54| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse29 16 .cse30)) |v_#memory_$Pointer$.base_65|) (= (store |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse31 0))) |v_#memory_$Pointer$.base_53|) (= (store |v_#memory_$Pointer$.base_53| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse31 8 (select .cse29 8))) |v_#memory_$Pointer$.base_54|)))) .cse2 (exists ((|v_#memory_int_66| (Array Int (Array Int Int)))) (let ((.cse32 (select |v_#memory_int_66| 1))) (and (= (select .cse32 1) 0) (= (store |v_#memory_int_66| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |v_#memory_int_66| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0) 16 0)) |v_#memory_int_79|) (= 48 (select .cse32 0))))) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int)))) (let ((.cse35 (select |v_#memory_$Pointer$.offset_53| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse33 (select |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse33 16 .cse34)) |v_#memory_$Pointer$.offset_65|) (= (store |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse35 0))) |v_#memory_$Pointer$.offset_53|) (= (store |v_#memory_$Pointer$.offset_53| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse35 8 (select .cse33 8))) |v_#memory_$Pointer$.offset_54|)))) .cse5 .cse6 (= 5 |c_ULTIMATE.start_dll_create_~len#1|) .cse36 (exists ((|v_#length_59| (Array Int Int))) (and (= (store |v_#length_59| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 20) |c_#length|) (= 2 (select |v_#length_59| 1)) (= (select |v_#length_59| 2) 18))) .cse37 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) .cse38 (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1))) (and .cse0 .cse1 (exists ((|v_#memory_int_66| (Array Int (Array Int Int))) (|v_#memory_int_70| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (let ((.cse39 (select |v_#memory_int_66| 1)) (.cse40 (select |v_#memory_int_70| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |v_#memory_int_79| (store |v_#memory_int_71| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |v_#memory_int_71| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0) 16 0))) (= (select .cse39 1) 0) (= 48 (select .cse39 0)) (= (store |v_#memory_int_70| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse40 12 (select (select |v_#memory_int_71| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12))) |v_#memory_int_71|) (= (store |v_#memory_int_66| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store (store (store (select |v_#memory_int_66| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse40 4))) |v_#memory_int_70|)))) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_58| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_$Pointer$.base_55| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse46 (select |v_#memory_$Pointer$.base_58| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse41 (select |v_#memory_$Pointer$.base_59| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse44 (select |v_#memory_$Pointer$.base_53| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse42 (select |v_#memory_$Pointer$.base_54| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_59| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse41 16 .cse30)) |v_#memory_$Pointer$.base_65|) (= (store |v_#memory_$Pointer$.base_54| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse42 16 (select .cse43 16))) |v_#memory_$Pointer$.base_55|) (= (store |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse44 0))) |v_#memory_$Pointer$.base_53|) (= (let ((.cse45 (store |v_#memory_$Pointer$.base_55| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse43 4 0) 12 0)))) (store .cse45 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse45 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse46 0)))) |v_#memory_$Pointer$.base_58|) (= |v_#memory_$Pointer$.base_59| (store |v_#memory_$Pointer$.base_58| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse46 8 (select .cse41 8)))) (= (store |v_#memory_$Pointer$.base_53| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse44 8 (select .cse42 8))) |v_#memory_$Pointer$.base_54|)))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse18 .cse26 .cse47 .cse37 .cse38 (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_59| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_58| (Array Int (Array Int Int)))) (let ((.cse48 (select |v_#memory_$Pointer$.offset_58| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse51 (select |v_#memory_$Pointer$.offset_55| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse49 (select |v_#memory_$Pointer$.offset_59| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse53 (select |v_#memory_$Pointer$.offset_53| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse52 (select |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_58| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse48 8 (select .cse49 8))) |v_#memory_$Pointer$.offset_59|) (= (let ((.cse50 (store |v_#memory_$Pointer$.offset_55| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse51 4 0) 12 0)))) (store .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse48 0)))) |v_#memory_$Pointer$.offset_58|) (= (store |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse52 16 (select .cse51 16))) |v_#memory_$Pointer$.offset_55|) (= (store |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse53 0))) |v_#memory_$Pointer$.offset_53|) (= (store |v_#memory_$Pointer$.offset_59| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse49 16 .cse34)) |v_#memory_$Pointer$.offset_65|) (= (store |v_#memory_$Pointer$.offset_53| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse53 8 (select .cse52 8))) |v_#memory_$Pointer$.offset_54|))))))) (= (store |v_#memory_int_80| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse54 12 .cse8)) |c_#memory_int|) (= |v_#memory_int_80| (store |v_#memory_int_79| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_int_79| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 (select .cse54 4))))))) .cse47 .cse37 .cse38))) is different from false [2024-11-09 01:30:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:30:05,023 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-11-09 01:30:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:30:05,024 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 01:30:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:30:05,025 INFO L225 Difference]: With dead ends: 86 [2024-11-09 01:30:05,025 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 01:30:05,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 121.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=32, NotChecked=26, Total=240 [2024-11-09 01:30:05,026 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 0 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 79.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:30:05,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 316 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 518 Invalid, 33 Unknown, 22 Unchecked, 79.7s Time] [2024-11-09 01:30:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 01:30:05,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 01:30:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 85 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:30:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2024-11-09 01:30:05,038 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 21 [2024-11-09 01:30:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:30:05,039 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2024-11-09 01:30:05,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:30:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2024-11-09 01:30:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 01:30:05,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:30:05,040 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-09 01:30:05,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:30:05,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:30:05,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:30:05,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:30:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1954874380, now seen corresponding path program 1 times [2024-11-09 01:30:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:30:05,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328254688] [2024-11-09 01:30:05,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:30:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:30:05,852 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:30:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328254688] [2024-11-09 01:30:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328254688] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:30:05,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140096696] [2024-11-09 01:30:05,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:30:05,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:30:05,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:30:05,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:30:05,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:30:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:30:06,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:30:06,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:30:06,037 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-09 01:30:06,336 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 01:30:06,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 01:30:06,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:30:06,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:30:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:30:07,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140096696] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:30:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [103595335] [2024-11-09 01:30:07,415 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-09 01:30:07,415 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:30:07,415 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:30:07,416 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:30:07,416 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:30:09,025 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:30:34,955 WARN L286 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 204 DAG size of output: 195 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:30:48,513 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 232 DAG size of output: 227 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:31:13,569 WARN L286 SmtUtils]: Spent 9.64s on a formula simplification. DAG size of input: 250 DAG size of output: 244 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:31:40,689 WARN L286 SmtUtils]: Spent 11.77s on a formula simplification. DAG size of input: 258 DAG size of output: 252 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:32:05,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [103595335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:32:05,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:32:05,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 3, 4] total 17 [2024-11-09 01:32:05,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782925598] [2024-11-09 01:32:05,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:32:05,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 01:32:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:32:05,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 01:32:05,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=205, Unknown=31, NotChecked=0, Total=306 [2024-11-09 01:32:05,548 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:32:08,691 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-09 01:32:10,698 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-09 01:32:12,847 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-09 01:32:14,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:16,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:18,483 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-09 01:32:20,493 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-09 01:32:22,737 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-09 01:32:24,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:26,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:28,816 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-09 01:32:31,373 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-09 01:32:33,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:35,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:36,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:39,700 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-09 01:32:41,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:43,817 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-09 01:32:45,828 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-09 01:32:48,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:50,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:54,415 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-09 01:32:56,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:32:58,596 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-09 01:33:00,606 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-09 01:33:02,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:04,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:08,965 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 [0] [2024-11-09 01:33:10,972 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-09 01:33:12,989 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 [0] [2024-11-09 01:33:15,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:17,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:33:19,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse49 (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse55 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1))) (let ((.cse0 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_create_~len#1| 4)) (.cse10 (= |c_#valid| (store .cse55 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1))) (.cse11 (= (select .cse55 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)) (.cse21 (exists ((|v_#length_67| (Array Int Int))) (and (= 2 (select |v_#length_67| 1)) (= (select |v_#length_67| 2) 18) (= (store (store |v_#length_67| |c_ULTIMATE.start_dll_create_~head~0#1.base| 20) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 20) |c_#length|)))) (.cse22 (not .cse49)) (.cse23 (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|)) (.cse9 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse12 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse13 (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse24 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse25 (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse29 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))) (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_92| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_81| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (let ((.cse5 (select |v_#memory_$Pointer$.base_82| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse4 (select |v_#memory_$Pointer$.base_85| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse6 (select |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (select |v_#memory_$Pointer$.base_81| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse8 (select |v_#memory_$Pointer$.base_86| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse2 (select |v_#memory_$Pointer$.base_92| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_92| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse2 4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12 0))) (= (let ((.cse3 (store |v_#memory_$Pointer$.base_82| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse5 4 0) 12 0)))) (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse4 0)))) |v_#memory_$Pointer$.base_85|) (= |v_#memory_$Pointer$.base_80| (store |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse6 0)))) (= (store |v_#memory_$Pointer$.base_81| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 16 (select .cse5 16))) |v_#memory_$Pointer$.base_82|) (= (store |v_#memory_$Pointer$.base_85| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 8 (select .cse8 8))) |v_#memory_$Pointer$.base_86|) (= (store |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse6 8 (select .cse7 8))) |v_#memory_$Pointer$.base_81|) (= (store |v_#memory_$Pointer$.base_86| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse8 16 (select .cse2 16))) |v_#memory_$Pointer$.base_92|)))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) .cse9 .cse10 (<= 1 |c_#StackHeapBarrier|) .cse11 .cse12 .cse13 (exists ((|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_92| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_#memory_$Pointer$.offset_85| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse20 (select |v_#memory_$Pointer$.offset_86| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse16 (select |v_#memory_$Pointer$.offset_92| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse14 (select |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse15 (select |v_#memory_$Pointer$.offset_81| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse19 (select |v_#memory_$Pointer$.offset_82| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse14 8 (select .cse15 8))) |v_#memory_$Pointer$.offset_81|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_92| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse16 4 0) 12 0))) (= (let ((.cse17 (store |v_#memory_$Pointer$.offset_82| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse19 4 0) 12 0)))) (store .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse18 0)))) |v_#memory_$Pointer$.offset_85|) (= (store |v_#memory_$Pointer$.offset_85| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse18 8 (select .cse20 8))) |v_#memory_$Pointer$.offset_86|) (= (store |v_#memory_$Pointer$.offset_86| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse20 16 (select .cse16 16))) |v_#memory_$Pointer$.offset_92|) (= (store |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse14 0))) |v_#memory_$Pointer$.offset_80|) (= (store |v_#memory_$Pointer$.offset_81| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse15 16 (select .cse19 16))) |v_#memory_$Pointer$.offset_82|)))) .cse21 .cse22 .cse23 .cse24 .cse25 (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_int_97| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_int_93| (Array Int (Array Int Int)))) (let ((.cse27 (select |v_#memory_int_93| 1)) (.cse26 (select |v_#memory_int_97| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse28 (select |v_#memory_int_107| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |v_#memory_int_97| (store |v_#memory_int_93| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store (store (store (select |v_#memory_int_93| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse26 4)))) (= (select .cse27 0) 48) (= (select .cse27 1) 0) (= (store |v_#memory_int_98| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (store (select |v_#memory_int_98| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse28 4))) |v_#memory_int_107|) (= (store |v_#memory_int_97| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse26 12 (select (select |v_#memory_int_98| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12))) |v_#memory_int_98|) (= (store |v_#memory_int_107| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse28 12 .cse29)) |c_#memory_int|)))) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_92| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_92| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_$Pointer$.base_92| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse54 (select |v_#memory_$Pointer$.offset_92| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse30 (select |v_#memory_int_107| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |v_#memory_int_107| (store |v_#memory_int_106| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_int_106| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 (select .cse30 4)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_92| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse31 4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12 0))) (let ((.cse47 (select .cse31 16)) (.cse40 (select .cse54 16))) (or (and .cse0 .cse1 (exists ((|v_#memory_int_97| (Array Int (Array Int Int))) (|v_#memory_int_98| (Array Int (Array Int Int))) (|v_#memory_int_93| (Array Int (Array Int Int)))) (let ((.cse33 (select |v_#memory_int_93| 1)) (.cse32 (select |v_#memory_int_97| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |v_#memory_int_97| (store |v_#memory_int_93| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store (store (store (select |v_#memory_int_93| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse32 4)))) (= (select .cse33 0) 48) (= (select .cse33 1) 0) (= (store |v_#memory_int_98| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |v_#memory_int_98| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0) 16 0)) |v_#memory_int_106|) (= (store |v_#memory_int_97| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse32 12 (select (select |v_#memory_int_98| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12))) |v_#memory_int_98|)))) .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (let ((.cse37 (select |v_#memory_$Pointer$.offset_85| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse39 (select |v_#memory_$Pointer$.offset_86| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse34 (select |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse35 (select |v_#memory_$Pointer$.offset_81| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse38 (select |v_#memory_$Pointer$.offset_82| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse34 8 (select .cse35 8))) |v_#memory_$Pointer$.offset_81|) (= (let ((.cse36 (store |v_#memory_$Pointer$.offset_82| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse38 4 0) 12 0)))) (store .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse37 0)))) |v_#memory_$Pointer$.offset_85|) (= (store |v_#memory_$Pointer$.offset_85| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse37 8 (select .cse39 8))) |v_#memory_$Pointer$.offset_86|) (= (store |v_#memory_$Pointer$.offset_86| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse39 16 .cse40)) |v_#memory_$Pointer$.offset_92|) (= (store |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse34 0))) |v_#memory_$Pointer$.offset_80|) (= (store |v_#memory_$Pointer$.offset_81| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse35 16 (select .cse38 16))) |v_#memory_$Pointer$.offset_82|)))) .cse21 .cse22 (exists ((|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_81| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_$Pointer$.base_82| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse42 (select |v_#memory_$Pointer$.base_85| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse44 (select |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse45 (select |v_#memory_$Pointer$.base_81| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse46 (select |v_#memory_$Pointer$.base_86| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (let ((.cse41 (store |v_#memory_$Pointer$.base_82| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse43 4 0) 12 0)))) (store .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse42 0)))) |v_#memory_$Pointer$.base_85|) (= |v_#memory_$Pointer$.base_80| (store |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse44 0)))) (= (store |v_#memory_$Pointer$.base_81| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse45 16 (select .cse43 16))) |v_#memory_$Pointer$.base_82|) (= (store |v_#memory_$Pointer$.base_85| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse42 8 (select .cse46 8))) |v_#memory_$Pointer$.base_86|) (= (store |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse44 8 (select .cse45 8))) |v_#memory_$Pointer$.base_81|) (= (store |v_#memory_$Pointer$.base_86| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse46 16 .cse47)) |v_#memory_$Pointer$.base_92|)))) .cse23 .cse24 .cse25) (and .cse9 .cse12 .cse13 (= 5 |c_ULTIMATE.start_dll_create_~len#1|) (exists ((|v_#memory_int_93| (Array Int (Array Int Int)))) (let ((.cse48 (select |v_#memory_int_93| 1))) (and (= (store |v_#memory_int_93| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (select |v_#memory_int_93| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0) 16 0)) |v_#memory_int_106|) (= (select .cse48 0) 48) (= (select .cse48 1) 0)))) .cse49 (exists ((|v_#memory_$Pointer$.base_81| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int)))) (let ((.cse50 (select |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse51 (select |v_#memory_$Pointer$.base_81| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse50 0))) |v_#memory_$Pointer$.base_80|) (= |v_#memory_$Pointer$.base_92| (store |v_#memory_$Pointer$.base_81| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse51 16 .cse47))) (= (store |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse50 8 (select .cse51 8))) |v_#memory_$Pointer$.base_81|)))) .cse24 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (exists ((|v_#length_67| (Array Int Int))) (and (= (store |v_#length_67| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 20) |c_#length|) (= 2 (select |v_#length_67| 1)) (= (select |v_#length_67| 2) 18))) .cse25 (exists ((|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_81| (Array Int (Array Int Int)))) (let ((.cse52 (select |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse53 (select |v_#memory_$Pointer$.offset_81| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse52 0))) |v_#memory_$Pointer$.offset_80|) (= (store |v_#memory_$Pointer$.offset_81| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse53 16 .cse40)) |v_#memory_$Pointer$.offset_92|) (= (store |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse52 8 (select .cse53 8))) |v_#memory_$Pointer$.offset_81|)))) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1))))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_92| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse54 4 0) 12 0))) (= (store |v_#memory_int_107| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse30 12 .cse29)) |c_#memory_int|))))))) is different from false [2024-11-09 01:33:22,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:22,325 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2024-11-09 01:33:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:33:22,326 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 01:33:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:22,327 INFO L225 Difference]: With dead ends: 86 [2024-11-09 01:33:22,327 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 01:33:22,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 119.1s TimeCoverageRelationStatistics Valid=72, Invalid=206, Unknown=32, NotChecked=32, Total=342 [2024-11-09 01:33:22,328 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 0 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 74.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:22,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 290 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 469 Invalid, 32 Unknown, 10 Unchecked, 74.6s Time] [2024-11-09 01:33:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 01:33:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 01:33:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.5901639344262295) internal successors, (97), 85 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:33:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2024-11-09 01:33:22,346 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 21 [2024-11-09 01:33:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:22,346 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2024-11-09 01:33:22,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:33:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2024-11-09 01:33:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 01:33:22,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:22,347 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:22,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:33:22,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:33:22,549 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:33:22,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash -486262414, now seen corresponding path program 1 times [2024-11-09 01:33:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:33:22,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345708866] [2024-11-09 01:33:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:22,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 01:33:22,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:33:22,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345708866] [2024-11-09 01:33:22,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345708866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:33:22,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:33:22,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:33:22,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313546562] [2024-11-09 01:33:22,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:33:22,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:33:22,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:33:22,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:33:22,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:33:22,789 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:33:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:23,485 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-11-09 01:33:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:33:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 01:33:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:23,488 INFO L225 Difference]: With dead ends: 81 [2024-11-09 01:33:23,488 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 01:33:23,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 01:33:23,489 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:23,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 86 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 01:33:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 01:33:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 01:33:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.476923076923077) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:33:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2024-11-09 01:33:23,496 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 25 [2024-11-09 01:33:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:23,497 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2024-11-09 01:33:23,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:33:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2024-11-09 01:33:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 01:33:23,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:23,498 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:33:23,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 01:33:23,498 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:33:23,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:23,499 INFO L85 PathProgramCache]: Analyzing trace with hash -486262413, now seen corresponding path program 1 times [2024-11-09 01:33:23,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:33:23,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713254561] [2024-11-09 01:33:23,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:33:23,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:33:23,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713254561] [2024-11-09 01:33:23,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713254561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:23,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302849822] [2024-11-09 01:33:23,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:23,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:33:23,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:33:23,697 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:33:23,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:33:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:23,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 01:33:23,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:33:24,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:33:24,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302849822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:33:24,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [8473806] [2024-11-09 01:33:24,268 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2024-11-09 01:33:24,268 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:33:24,269 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:33:24,269 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:33:24,269 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:33:29,796 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:33:41,308 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1760#true' at error location [2024-11-09 01:33:41,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:33:41,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:33:41,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-09 01:33:41,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976119620] [2024-11-09 01:33:41,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:33:41,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:33:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:33:41,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:33:41,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=210, Unknown=4, NotChecked=0, Total=272 [2024-11-09 01:33:41,311 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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-09 01:33:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:33:41,628 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2024-11-09 01:33:41,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 01:33:41,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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-09 01:33:41,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:33:41,630 INFO L225 Difference]: With dead ends: 142 [2024-11-09 01:33:41,630 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 01:33:41,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=58, Invalid=210, Unknown=4, NotChecked=0, Total=272 [2024-11-09 01:33:41,631 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 18 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:33:41,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 260 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:33:41,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 01:33:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2024-11-09 01:33:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 137 states have internal predecessors, (159), 0 states have call successors, (0), 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-09 01:33:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2024-11-09 01:33:41,641 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 25 [2024-11-09 01:33:41,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:33:41,642 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2024-11-09 01:33:41,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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-09 01:33:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2024-11-09 01:33:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 01:33:41,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:33:41,643 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-09 01:33:41,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:33:41,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:33:41,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:33:41,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:33:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash 519495953, now seen corresponding path program 1 times [2024-11-09 01:33:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:33:41,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302660755] [2024-11-09 01:33:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:33:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:33:42,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:33:42,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302660755] [2024-11-09 01:33:42,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302660755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:33:42,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570615190] [2024-11-09 01:33:42,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:33:42,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:33:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:33:42,284 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:33:42,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:33:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:33:42,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:33:42,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:33:42,492 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-09 01:33:42,513 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-09 01:33:42,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 01:33:42,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 01:33:42,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:33:42,963 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-09 01:33:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:33:43,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:33:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 01:33:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570615190] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:33:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2091480907] [2024-11-09 01:33:44,178 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-09 01:33:44,178 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:33:44,179 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:33:44,179 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:33:44,179 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:33:49,639 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:34:02,086 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2397#(and (exists ((|v_#memory_int_165| (Array Int (Array Int Int))) (|v_#memory_int_166| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_166| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_int_166| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12))))) (= (store |v_#memory_int_165| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_int_165| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) (select (select |v_#memory_int_166| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) |v_#memory_int_166|))) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (<= (+ 16 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_44| Int) (|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_151| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_46| Int)) (and (or (< (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_44| 12) 0) (< (select |#length| |v_ULTIMATE.start_dll_create_~head~0#1.base_46|) (+ 16 |v_ULTIMATE.start_dll_create_~head~0#1.offset_44|))) (or (not (= |v_ULTIMATE.start_dll_create_~head~0#1.offset_44| 0)) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_46|))) (= (store |v_#memory_$Pointer$.base_151| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_$Pointer$.base_151| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |v_ULTIMATE.start_dll_create_~head~0#1.base_46|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) 0)) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_151| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_151| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |v_ULTIMATE.start_dll_create_~head~0#1.offset_44|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) 0))))))' at error location [2024-11-09 01:34:02,086 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:34:02,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:34:02,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2024-11-09 01:34:02,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720609645] [2024-11-09 01:34:02,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:34:02,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 01:34:02,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:34:02,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 01:34:02,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=301, Unknown=6, NotChecked=0, Total=380 [2024-11-09 01:34:02,089 INFO L87 Difference]: Start difference. First operand 138 states and 159 transitions. Second operand has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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-09 01:34:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:03,257 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2024-11-09 01:34:03,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:34:03,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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 32 [2024-11-09 01:34:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:03,259 INFO L225 Difference]: With dead ends: 137 [2024-11-09 01:34:03,259 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 01:34:03,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=102, Invalid=392, Unknown=12, NotChecked=0, Total=506 [2024-11-09 01:34:03,261 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 12 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:03,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 237 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:34:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 01:34:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-09 01:34:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 133 states have internal predecessors, (153), 0 states have call successors, (0), 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-09 01:34:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2024-11-09 01:34:03,273 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 32 [2024-11-09 01:34:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:03,274 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2024-11-09 01:34:03,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 10 states have internal predecessors, (71), 0 states have call successors, (0), 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-09 01:34:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2024-11-09 01:34:03,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 01:34:03,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:03,277 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:03,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 01:34:03,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:03,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:34:03,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1037449818, now seen corresponding path program 2 times [2024-11-09 01:34:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:34:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028831075] [2024-11-09 01:34:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 82 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 01:34:03,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:34:03,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028831075] [2024-11-09 01:34:03,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028831075] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:34:03,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460947153] [2024-11-09 01:34:03,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:34:03,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:03,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:34:03,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:34:03,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:34:03,925 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 01:34:03,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:34:03,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 01:34:03,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:03,950 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-09 01:34:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 01:34:04,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:34:04,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460947153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:04,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 01:34:04,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-09 01:34:04,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746534622] [2024-11-09 01:34:04,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:04,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:34:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:34:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:34:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:34:04,257 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-09 01:34:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:05,089 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2024-11-09 01:34:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:34:05,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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 55 [2024-11-09 01:34:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:05,091 INFO L225 Difference]: With dead ends: 158 [2024-11-09 01:34:05,091 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 01:34:05,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:34:05,093 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:05,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 124 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 01:34:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 01:34:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2024-11-09 01:34:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 153 states have internal predecessors, (181), 0 states have call successors, (0), 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-09 01:34:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 181 transitions. [2024-11-09 01:34:05,104 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 181 transitions. Word has length 55 [2024-11-09 01:34:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:05,104 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 181 transitions. [2024-11-09 01:34:05,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-09 01:34:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 181 transitions. [2024-11-09 01:34:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 01:34:05,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:05,111 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:05,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 01:34:05,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:05,312 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:34:05,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1726147498, now seen corresponding path program 1 times [2024-11-09 01:34:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:34:05,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953961567] [2024-11-09 01:34:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 82 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 01:34:05,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:34:05,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953961567] [2024-11-09 01:34:05,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953961567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:34:05,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080814433] [2024-11-09 01:34:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:05,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:05,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:34:05,589 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:34:05,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 01:34:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:05,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 01:34:05,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 82 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 01:34:06,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:34:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 82 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 01:34:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080814433] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:34:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933592173] [2024-11-09 01:34:06,185 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 01:34:06,185 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:34:06,185 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:34:06,186 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:34:06,186 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:34:11,243 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:34:48,779 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3522#(and (= (select |#valid| 0) 1) (exists ((|v_ULTIMATE.start_main_old_#valid#1_10| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_10| |#valid|))) (= (select (select |#memory_$Pointer$.base| 0) 4) 0) (<= 8 (select |#length| 0)) (= (select (select |#memory_$Pointer$.offset| 0) 4) 0) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-09 01:34:48,779 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:34:48,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:34:48,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-09 01:34:48,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918715143] [2024-11-09 01:34:48,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:34:48,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:34:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:34:48,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:34:48,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=223, Unknown=13, NotChecked=0, Total=306 [2024-11-09 01:34:48,782 INFO L87 Difference]: Start difference. First operand 154 states and 181 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-09 01:34:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:49,087 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2024-11-09 01:34:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:34:49,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 59 [2024-11-09 01:34:49,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:49,089 INFO L225 Difference]: With dead ends: 124 [2024-11-09 01:34:49,089 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 01:34:49,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=74, Invalid=255, Unknown=13, NotChecked=0, Total=342 [2024-11-09 01:34:49,090 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:49,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 137 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:34:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 01:34:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-09 01:34:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 123 states have internal predecessors, (144), 0 states have call successors, (0), 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-09 01:34:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2024-11-09 01:34:49,096 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 59 [2024-11-09 01:34:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:49,096 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2024-11-09 01:34:49,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-09 01:34:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2024-11-09 01:34:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:34:49,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:49,098 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:49,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 01:34:49,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:49,299 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:34:49,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1802826268, now seen corresponding path program 2 times [2024-11-09 01:34:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:34:49,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287702161] [2024-11-09 01:34:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:49,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-09 01:34:49,576 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:34:49,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287702161] [2024-11-09 01:34:49,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287702161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:49,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:49,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:34:49,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846230770] [2024-11-09 01:34:49,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:49,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:34:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:34:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:34:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:34:49,578 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 01:34:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:50,081 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2024-11-09 01:34:50,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:34:50,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 62 [2024-11-09 01:34:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:50,083 INFO L225 Difference]: With dead ends: 130 [2024-11-09 01:34:50,083 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 01:34:50,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 01:34:50,084 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:50,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 148 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 01:34:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 01:34:50,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2024-11-09 01:34:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 123 states have internal predecessors, (142), 0 states have call successors, (0), 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-09 01:34:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2024-11-09 01:34:50,090 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 62 [2024-11-09 01:34:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:50,090 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2024-11-09 01:34:50,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-09 01:34:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2024-11-09 01:34:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 01:34:50,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:50,093 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:50,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 01:34:50,093 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:34:50,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash 435939424, now seen corresponding path program 1 times [2024-11-09 01:34:50,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:34:50,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232810373] [2024-11-09 01:34:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 01:34:50,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:34:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232810373] [2024-11-09 01:34:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232810373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:34:50,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:34:50,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 01:34:50,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356016542] [2024-11-09 01:34:50,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:34:50,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:34:50,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:34:50,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:34:50,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:50,352 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:34:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:34:50,557 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2024-11-09 01:34:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:34:50,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 01:34:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:34:50,558 INFO L225 Difference]: With dead ends: 130 [2024-11-09 01:34:50,559 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 01:34:50,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:34:50,559 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:34:50,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:34:50,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 01:34:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2024-11-09 01:34:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 126 states have internal predecessors, (145), 0 states have call successors, (0), 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-09 01:34:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2024-11-09 01:34:50,563 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 66 [2024-11-09 01:34:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:34:50,564 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2024-11-09 01:34:50,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:34:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2024-11-09 01:34:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 01:34:50,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:34:50,565 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:34:50,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 01:34:50,566 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:34:50,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:34:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash 629140929, now seen corresponding path program 1 times [2024-11-09 01:34:50,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:34:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743364700] [2024-11-09 01:34:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:34:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-09 01:34:52,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:34:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743364700] [2024-11-09 01:34:52,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743364700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:34:52,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910706294] [2024-11-09 01:34:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:34:52,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:34:52,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:34:52,134 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:34:52,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 01:34:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:34:52,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 01:34:52,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:34:52,513 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-09 01:34:52,658 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:34:52,659 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-09 01:34:52,698 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 11 treesize of output 7 [2024-11-09 01:34:52,729 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-09 01:34:52,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:52,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-09 01:34:53,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:53,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2024-11-09 01:34:53,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:34:53,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2024-11-09 01:34:53,201 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 34 treesize of output 25 [2024-11-09 01:34:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 01:34:53,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:34:53,789 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2187 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2024-11-09 01:34:53,824 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2185 Int) (v_ArrVal_2187 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2185)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) is different from false [2024-11-09 01:34:58,197 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 64 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 3 not checked. [2024-11-09 01:34:58,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910706294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:34:58,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732806843] [2024-11-09 01:34:58,200 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:34:58,200 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:34:58,201 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:34:58,201 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:34:58,201 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:35:03,219 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:35:33,142 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4724#(and (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~1#1.base|) (+ |ULTIMATE.start_main_~head~1#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~1#1.base|) (+ |ULTIMATE.start_main_~head~1#1.offset| 4)) 0))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~head~1#1.base|) |ULTIMATE.start_main_~head~1#1.offset|) 0)) (<= 0 |ULTIMATE.start_main_~head~1#1.offset|) (<= (+ |ULTIMATE.start_main_~head~1#1.offset| 8) (select |#length| |ULTIMATE.start_main_~head~1#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~head~1#1.base|) 1))' at error location [2024-11-09 01:35:33,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:35:33,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:35:33,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 19 [2024-11-09 01:35:33,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192534364] [2024-11-09 01:35:33,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:35:33,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 01:35:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:35:33,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 01:35:33,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=850, Unknown=12, NotChecked=122, Total=1122 [2024-11-09 01:35:33,145 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 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-09 01:35:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:35:35,930 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2024-11-09 01:35:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 01:35:35,930 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 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 67 [2024-11-09 01:35:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:35:35,931 INFO L225 Difference]: With dead ends: 132 [2024-11-09 01:35:35,931 INFO L226 Difference]: Without dead ends: 132 [2024-11-09 01:35:35,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 181 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=307, Invalid=1669, Unknown=12, NotChecked=174, Total=2162 [2024-11-09 01:35:35,933 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:35:35,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 537 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 395 Invalid, 0 Unknown, 136 Unchecked, 1.4s Time] [2024-11-09 01:35:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-09 01:35:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2024-11-09 01:35:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 126 states have internal predecessors, (144), 0 states have call successors, (0), 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-09 01:35:35,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2024-11-09 01:35:35,941 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 67 [2024-11-09 01:35:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:35:35,942 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2024-11-09 01:35:35,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 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-09 01:35:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2024-11-09 01:35:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 01:35:35,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:35:35,944 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:35:35,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 01:35:36,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 01:35:36,148 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:35:36,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:35:36,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1609981093, now seen corresponding path program 1 times [2024-11-09 01:35:36,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:35:36,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832890443] [2024-11-09 01:35:36,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:36,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:35:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 01:35:38,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:35:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832890443] [2024-11-09 01:35:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832890443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:35:38,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632268570] [2024-11-09 01:35:38,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:35:38,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:35:38,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:35:38,215 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:35:38,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 01:35:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:35:38,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 01:35:38,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:35:38,636 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-09 01:35:38,845 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 01:35:38,845 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 19 treesize of output 16 [2024-11-09 01:35:39,070 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 13 treesize of output 9 [2024-11-09 01:35:39,235 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 23 treesize of output 22 [2024-11-09 01:35:39,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 01:35:39,476 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 51 treesize of output 48 [2024-11-09 01:35:40,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:40,075 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 40 treesize of output 16 [2024-11-09 01:35:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 64 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 01:35:40,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:35:40,473 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2562 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2562) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2024-11-09 01:35:40,499 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2562 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2562) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 1)) is different from false [2024-11-09 01:35:40,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:40,534 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 2 case distinctions, treesize of input 29 treesize of output 35 [2024-11-09 01:35:40,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:35:40,549 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 50 treesize of output 32 [2024-11-09 01:35:40,571 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 9 treesize of output 5 [2024-11-09 01:35:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 3 not checked. [2024-11-09 01:35:42,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632268570] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:35:42,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [338565593] [2024-11-09 01:35:42,413 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:35:42,414 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:35:42,414 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:35:42,414 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:35:42,415 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:35:47,457 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:36:44,463 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5456#(exists ((|v_ULTIMATE.start_main_~head~1#1.base_76| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~head~1#1.base_76|) 1)))' at error location [2024-11-09 01:36:44,464 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:36:44,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:36:44,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2024-11-09 01:36:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806877536] [2024-11-09 01:36:44,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:36:44,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 01:36:44,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:36:44,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 01:36:44,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1522, Unknown=22, NotChecked=162, Total=1892 [2024-11-09 01:36:44,467 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 25 states have internal predecessors, (112), 0 states have call successors, (0), 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-09 01:36:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:36:48,173 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2024-11-09 01:36:48,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 01:36:48,174 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 25 states have internal predecessors, (112), 0 states have call successors, (0), 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 68 [2024-11-09 01:36:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:36:48,175 INFO L225 Difference]: With dead ends: 133 [2024-11-09 01:36:48,175 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 01:36:48,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 60.1s TimeCoverageRelationStatistics Valid=333, Invalid=2305, Unknown=22, NotChecked=202, Total=2862 [2024-11-09 01:36:48,178 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 128 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 01:36:48,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 348 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 654 Invalid, 0 Unknown, 222 Unchecked, 2.5s Time] [2024-11-09 01:36:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 01:36:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2024-11-09 01:36:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 127 states have internal predecessors, (146), 0 states have call successors, (0), 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-09 01:36:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2024-11-09 01:36:48,184 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 68 [2024-11-09 01:36:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:36:48,185 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2024-11-09 01:36:48,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 25 states have internal predecessors, (112), 0 states have call successors, (0), 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-09 01:36:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2024-11-09 01:36:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 01:36:48,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:36:48,187 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:36:48,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 01:36:48,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 01:36:48,391 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:36:48,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:36:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1609981094, now seen corresponding path program 1 times [2024-11-09 01:36:48,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:36:48,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255574174] [2024-11-09 01:36:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:48,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:36:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 64 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 01:36:51,303 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:36:51,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255574174] [2024-11-09 01:36:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255574174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:36:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639437021] [2024-11-09 01:36:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:36:51,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:36:51,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:36:51,305 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:36:51,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 01:36:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:36:51,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 01:36:51,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:36:51,740 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-09 01:36:51,749 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-09 01:36:52,310 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:36:52,311 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-09 01:36:52,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 01:36:52,539 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 13 treesize of output 9 [2024-11-09 01:36:52,556 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 13 treesize of output 9 [2024-11-09 01:36:52,706 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 23 treesize of output 22 [2024-11-09 01:36:52,742 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 29 treesize of output 13 [2024-11-09 01:36:53,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 01:36:53,039 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 71 treesize of output 64 [2024-11-09 01:36:53,052 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 30 treesize of output 13 [2024-11-09 01:36:53,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-09 01:36:53,907 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 9 treesize of output 3 [2024-11-09 01:36:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 64 proven. 11 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 01:36:54,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:36:54,802 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2942 (Array Int Int)) (v_ArrVal_2941 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2942) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2941) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))) (forall ((v_ArrVal_2942 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2942) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 4))))) is different from false [2024-11-09 01:36:54,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2939 Int) (v_ArrVal_2942 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2939)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2942) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_2939 Int) (v_ArrVal_2942 (Array Int Int)) (v_ArrVal_2941 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_2939)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2942) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2941) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))))) is different from false [2024-11-09 01:36:54,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:54,920 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 2 case distinctions, treesize of input 29 treesize of output 35 [2024-11-09 01:36:54,936 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 40 treesize of output 28 [2024-11-09 01:36:55,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:55,006 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 61 [2024-11-09 01:36:55,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:36:55,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2024-11-09 01:36:55,066 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:36:55,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-11-09 01:36:55,078 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 01:36:55,082 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-09 01:36:56,157 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 3 not checked. [2024-11-09 01:36:56,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639437021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:36:56,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [85191817] [2024-11-09 01:36:56,160 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:36:56,160 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:36:56,160 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:36:56,161 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:36:56,161 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:36:58,854 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 01:37:27,843 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6190#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~head~1#1.base_84| Int) (|v_ULTIMATE.start_main_~head~1#1.offset_72| Int)) (and (or (< (select |#length| |v_ULTIMATE.start_main_~head~1#1.base_84|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_72| 8)) (< (+ |v_ULTIMATE.start_main_~head~1#1.offset_72| 4) 0)) (or (= |v_ULTIMATE.start_main_~head~1#1.offset_72| 0) (exists ((|v_ULTIMATE.start_main_~head~1#1.base_83| Int) (|v_ULTIMATE.start_main_~head~1#1.offset_71| Int)) (and (= (select (select |#memory_int| |v_ULTIMATE.start_main_~head~1#1.base_83|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_71| 16)) 0) (= |v_ULTIMATE.start_main_~head~1#1.base_84| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~1#1.base_83|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_71| 4))) (<= (+ |v_ULTIMATE.start_main_~head~1#1.offset_71| 20) (select |#length| |v_ULTIMATE.start_main_~head~1#1.base_83|)) (= |v_ULTIMATE.start_main_~head~1#1.offset_72| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~1#1.base_83|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_71| 4))) (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_71|) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~head~1#1.base_83|) |v_ULTIMATE.start_main_~head~1#1.offset_71|) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~head~1#1.base_83|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_71| 8)) 0) (= (select |#valid| |v_ULTIMATE.start_main_~head~1#1.base_83|) 1)))))))' at error location [2024-11-09 01:37:27,843 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 01:37:27,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:37:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2024-11-09 01:37:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102973994] [2024-11-09 01:37:27,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:37:27,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 01:37:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:37:27,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 01:37:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=2203, Unknown=8, NotChecked=194, Total=2652 [2024-11-09 01:37:27,846 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 31 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 01:37:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:37:33,263 INFO L93 Difference]: Finished difference Result 171 states and 201 transitions. [2024-11-09 01:37:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 01:37:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 31 states have internal predecessors, (124), 0 states have call successors, (0), 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 68 [2024-11-09 01:37:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:37:33,265 INFO L225 Difference]: With dead ends: 171 [2024-11-09 01:37:33,265 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 01:37:33,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=407, Invalid=3133, Unknown=8, NotChecked=234, Total=3782 [2024-11-09 01:37:33,268 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 231 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:37:33,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 580 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 884 Invalid, 0 Unknown, 286 Unchecked, 3.6s Time] [2024-11-09 01:37:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 01:37:33,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 136. [2024-11-09 01:37:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.2950819672131149) internal successors, (158), 135 states have internal predecessors, (158), 0 states have call successors, (0), 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-09 01:37:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 158 transitions. [2024-11-09 01:37:33,274 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 158 transitions. Word has length 68 [2024-11-09 01:37:33,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:37:33,274 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 158 transitions. [2024-11-09 01:37:33,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.133333333333334) internal successors, (124), 31 states have internal predecessors, (124), 0 states have call successors, (0), 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-09 01:37:33,275 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 158 transitions. [2024-11-09 01:37:33,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 01:37:33,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:37:33,276 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:37:33,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 01:37:33,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 01:37:33,477 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 01:37:33,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:37:33,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1605659951, now seen corresponding path program 1 times [2024-11-09 01:37:33,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:37:33,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548330216] [2024-11-09 01:37:33,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:33,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:37:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 54 proven. 32 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 01:37:35,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:37:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548330216] [2024-11-09 01:37:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548330216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:37:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420816039] [2024-11-09 01:37:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:37:35,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:37:35,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:37:35,716 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:37:35,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce5eb3d-55fc-45e3-a1b1-d28bc12de3cd/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 01:37:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:37:36,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 01:37:36,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:37:36,178 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-09 01:37:36,329 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 01:37:36,329 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-09 01:37:36,468 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 13 treesize of output 9 [2024-11-09 01:37:36,578 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 23 treesize of output 22 [2024-11-09 01:37:36,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:37:36,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-09 01:37:36,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:37:36,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-09 01:37:36,818 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 27 treesize of output 20 [2024-11-09 01:37:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 01:37:37,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:37:39,843 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3316 Int) (v_ArrVal_3318 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3316)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3318) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2024-11-09 01:37:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 64 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 1 not checked. [2024-11-09 01:37:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420816039] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:37:48,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [805693192] [2024-11-09 01:37:48,297 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 01:37:48,297 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:37:48,297 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 01:37:48,298 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 01:37:48,298 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 01:37:53,287 INFO L180 IcfgInterpreter]: Interpretation finished