./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a 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_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2 --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 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:25:13,067 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:25:13,125 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-02 12:25:13,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:25:13,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:25:13,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:25:13,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:25:13,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:25:13,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:25:13,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:25:13,165 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:25:13,166 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:25:13,166 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:25:13,167 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 12:25:13,167 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:25:13,167 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:25:13,168 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 12:25:13,168 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 12:25:13,169 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:25:13,169 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 12:25:13,169 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 12:25:13,170 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 12:25:13,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 12:25:13,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 12:25:13,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:25:13,172 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 12:25:13,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:25:13,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 12:25:13,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:25:13,173 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 12:25:13,174 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 12:25:13,174 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 12:25:13,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:25:13,175 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 12:25:13,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:25:13,175 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 12:25:13,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 12:25:13,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:25:13,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:25:13,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:25:13,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:25:13,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:25:13,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:25:13,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:25:13,179 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 12:25:13,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 12:25:13,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:25:13,180 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:25:13,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:25:13,180 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_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/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_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2024-11-02 12:25:13,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:25:13,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:25:13,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:25:13,514 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:25:13,515 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:25:13,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i Unable to find full path for "g++" [2024-11-02 12:25:15,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:25:15,831 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:25:15,832 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2024-11-02 12:25:15,848 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/data/1583e5638/a08337d75b1544a490483b04dae613a5/FLAG3d6ad3af8 [2024-11-02 12:25:15,868 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/data/1583e5638/a08337d75b1544a490483b04dae613a5 [2024-11-02 12:25:15,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:25:15,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:25:15,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:25:15,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:25:15,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:25:15,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:25:15" (1/1) ... [2024-11-02 12:25:15,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b25354c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:15, skipping insertion in model container [2024-11-02 12:25:15,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:25:15" (1/1) ... [2024-11-02 12:25:15,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:25:16,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:25:16,326 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:25:16,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:25:16,437 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:25:16,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16 WrapperNode [2024-11-02 12:25:16,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:25:16,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:25:16,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:25:16,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:25:16,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,495 INFO L138 Inliner]: procedures = 129, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2024-11-02 12:25:16,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:25:16,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:25:16,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:25:16,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:25:16,506 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:25:16,562 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:25:16,562 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:25:16,562 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:25:16,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (1/1) ... [2024-11-02 12:25:16,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:25:16,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:16,597 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:25:16,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:25:16,628 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-02 12:25:16,628 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-02 12:25:16,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-02 12:25:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 12:25:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-02 12:25:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-02 12:25:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-02 12:25:16,629 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2024-11-02 12:25:16,630 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2024-11-02 12:25:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 12:25:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-02 12:25:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2024-11-02 12:25:16,630 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2024-11-02 12:25:16,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 12:25:16,631 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2024-11-02 12:25:16,631 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2024-11-02 12:25:16,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:25:16,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:25:16,785 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:25:16,786 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:25:17,506 INFO L? ?]: Removed 194 outVars from TransFormulas that were not future-live. [2024-11-02 12:25:17,506 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:25:17,639 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:25:17,639 INFO L316 CfgBuilder]: Removed 33 assume(true) statements. [2024-11-02 12:25:17,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:25:17 BoogieIcfgContainer [2024-11-02 12:25:17,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:25:17,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:25:17,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:25:17,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:25:17,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:25:15" (1/3) ... [2024-11-02 12:25:17,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c97f592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:25:17, skipping insertion in model container [2024-11-02 12:25:17,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:25:16" (2/3) ... [2024-11-02 12:25:17,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c97f592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:25:17, skipping insertion in model container [2024-11-02 12:25:17,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:25:17" (3/3) ... [2024-11-02 12:25:17,657 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2024-11-02 12:25:17,679 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:25:17,679 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2024-11-02 12:25:17,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:25:17,766 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;@14d98c7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:25:17,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2024-11-02 12:25:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 196 states, 94 states have (on average 2.297872340425532) internal successors, (216), 182 states have internal predecessors, (216), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-02 12:25:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-02 12:25:17,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:17,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-02 12:25:17,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:17,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash 549208, now seen corresponding path program 1 times [2024-11-02 12:25:17,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139590853] [2024-11-02 12:25:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:17,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:18,149 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-02 12:25:18,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:18,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139590853] [2024-11-02 12:25:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139590853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:18,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:18,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:25:18,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443125929] [2024-11-02 12:25:18,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:18,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-02 12:25:18,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:18,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-02 12:25:18,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 12:25:18,194 INFO L87 Difference]: Start difference. First operand has 196 states, 94 states have (on average 2.297872340425532) internal successors, (216), 182 states have internal predecessors, (216), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-02 12:25:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:18,346 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2024-11-02 12:25:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-02 12:25:18,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-02 12:25:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:18,378 INFO L225 Difference]: With dead ends: 194 [2024-11-02 12:25:18,379 INFO L226 Difference]: Without dead ends: 193 [2024-11-02 12:25:18,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-02 12:25:18,393 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:18,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:25:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-02 12:25:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-02 12:25:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 90 states have (on average 2.088888888888889) internal successors, (188), 179 states have internal predecessors, (188), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-02 12:25:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2024-11-02 12:25:18,519 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 3 [2024-11-02 12:25:18,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:18,521 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2024-11-02 12:25:18,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-02 12:25:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2024-11-02 12:25:18,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 12:25:18,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:18,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 12:25:18,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 12:25:18,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:18,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash 17322000, now seen corresponding path program 1 times [2024-11-02 12:25:18,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:18,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296768495] [2024-11-02 12:25:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:18,692 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-02 12:25:18,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296768495] [2024-11-02 12:25:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296768495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:18,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:18,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:25:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013286988] [2024-11-02 12:25:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:18,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:25:18,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:18,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:25:18,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:25:18,701 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:18,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:18,975 INFO L93 Difference]: Finished difference Result 191 states and 212 transitions. [2024-11-02 12:25:18,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:25:18,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-02 12:25:18,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:18,983 INFO L225 Difference]: With dead ends: 191 [2024-11-02 12:25:18,983 INFO L226 Difference]: Without dead ends: 191 [2024-11-02 12:25:18,983 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-02 12:25:18,986 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:18,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 300 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:25:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-02 12:25:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-02 12:25:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 90 states have (on average 2.066666666666667) internal successors, (186), 177 states have internal predecessors, (186), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-02 12:25:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 212 transitions. [2024-11-02 12:25:19,014 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 212 transitions. Word has length 4 [2024-11-02 12:25:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:19,014 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 212 transitions. [2024-11-02 12:25:19,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:19,015 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 212 transitions. [2024-11-02 12:25:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 12:25:19,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:19,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 12:25:19,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 12:25:19,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:19,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:19,020 INFO L85 PathProgramCache]: Analyzing trace with hash 17322001, now seen corresponding path program 1 times [2024-11-02 12:25:19,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:19,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79797237] [2024-11-02 12:25:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:19,229 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-02 12:25:19,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79797237] [2024-11-02 12:25:19,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79797237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:19,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:19,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:25:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692146492] [2024-11-02 12:25:19,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:25:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:25:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:25:19,234 INFO L87 Difference]: Start difference. First operand 191 states and 212 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:19,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:19,437 INFO L93 Difference]: Finished difference Result 189 states and 210 transitions. [2024-11-02 12:25:19,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:25:19,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-02 12:25:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:19,440 INFO L225 Difference]: With dead ends: 189 [2024-11-02 12:25:19,441 INFO L226 Difference]: Without dead ends: 189 [2024-11-02 12:25:19,441 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-02 12:25:19,443 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 303 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.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:19,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 303 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:25:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-02 12:25:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-02 12:25:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 90 states have (on average 2.0444444444444443) internal successors, (184), 175 states have internal predecessors, (184), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-02 12:25:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 210 transitions. [2024-11-02 12:25:19,466 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 210 transitions. Word has length 4 [2024-11-02 12:25:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:19,467 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 210 transitions. [2024-11-02 12:25:19,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 210 transitions. [2024-11-02 12:25:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 12:25:19,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:19,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 12:25:19,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 12:25:19,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:19,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:19,471 INFO L85 PathProgramCache]: Analyzing trace with hash -533411793, now seen corresponding path program 1 times [2024-11-02 12:25:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:19,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89697840] [2024-11-02 12:25:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:19,776 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-02 12:25:19,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89697840] [2024-11-02 12:25:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89697840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:19,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:19,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:25:19,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576665211] [2024-11-02 12:25:19,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:19,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:25:19,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:19,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:25:19,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:25:19,779 INFO L87 Difference]: Start difference. First operand 189 states and 210 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:20,139 INFO L93 Difference]: Finished difference Result 184 states and 205 transitions. [2024-11-02 12:25:20,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:25:20,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-02 12:25:20,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:20,141 INFO L225 Difference]: With dead ends: 184 [2024-11-02 12:25:20,142 INFO L226 Difference]: Without dead ends: 184 [2024-11-02 12:25:20,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:25:20,143 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 34 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:20,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 475 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 12:25:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-02 12:25:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-02 12:25:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 90 states have (on average 1.988888888888889) internal successors, (179), 170 states have internal predecessors, (179), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-02 12:25:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 205 transitions. [2024-11-02 12:25:20,155 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 205 transitions. Word has length 6 [2024-11-02 12:25:20,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:20,155 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 205 transitions. [2024-11-02 12:25:20,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 205 transitions. [2024-11-02 12:25:20,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 12:25:20,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:20,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 12:25:20,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 12:25:20,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:20,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash -533411792, now seen corresponding path program 1 times [2024-11-02 12:25:20,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:20,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771751658] [2024-11-02 12:25:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:20,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:20,482 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-02 12:25:20,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:20,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771751658] [2024-11-02 12:25:20,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771751658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:20,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:20,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:25:20,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471777906] [2024-11-02 12:25:20,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:20,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:25:20,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:20,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:25:20,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:25:20,486 INFO L87 Difference]: Start difference. First operand 184 states and 205 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:20,868 INFO L93 Difference]: Finished difference Result 179 states and 200 transitions. [2024-11-02 12:25:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:25:20,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-02 12:25:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:20,870 INFO L225 Difference]: With dead ends: 179 [2024-11-02 12:25:20,871 INFO L226 Difference]: Without dead ends: 179 [2024-11-02 12:25:20,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:25:20,874 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 28 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:20,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 484 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 12:25:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-02 12:25:20,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-11-02 12:25:20,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 90 states have (on average 1.9333333333333333) internal successors, (174), 165 states have internal predecessors, (174), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-02 12:25:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 200 transitions. [2024-11-02 12:25:20,900 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 200 transitions. Word has length 6 [2024-11-02 12:25:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:20,901 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 200 transitions. [2024-11-02 12:25:20,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 200 transitions. [2024-11-02 12:25:20,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:25:20,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:20,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:20,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 12:25:20,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:20,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:20,907 INFO L85 PathProgramCache]: Analyzing trace with hash 644103743, now seen corresponding path program 1 times [2024-11-02 12:25:20,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:20,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203272513] [2024-11-02 12:25:20,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:20,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:21,007 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-02 12:25:21,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:21,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203272513] [2024-11-02 12:25:21,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203272513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:21,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:21,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:25:21,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056050006] [2024-11-02 12:25:21,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:21,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:25:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:25:21,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:25:21,012 INFO L87 Difference]: Start difference. First operand 179 states and 200 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:21,272 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2024-11-02 12:25:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:25:21,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-02 12:25:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:21,274 INFO L225 Difference]: With dead ends: 178 [2024-11-02 12:25:21,275 INFO L226 Difference]: Without dead ends: 178 [2024-11-02 12:25:21,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02 12:25:21,279 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:21,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 395 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:25:21,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-02 12:25:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-02 12:25:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 90 states have (on average 1.9222222222222223) internal successors, (173), 164 states have internal predecessors, (173), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-02 12:25:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2024-11-02 12:25:21,295 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 7 [2024-11-02 12:25:21,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:21,295 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2024-11-02 12:25:21,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2024-11-02 12:25:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:25:21,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:21,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:21,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 12:25:21,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:21,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash 644103744, now seen corresponding path program 1 times [2024-11-02 12:25:21,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:21,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577463651] [2024-11-02 12:25:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:21,459 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-02 12:25:21,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:21,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577463651] [2024-11-02 12:25:21,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577463651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:21,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:21,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:25:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274390373] [2024-11-02 12:25:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:21,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:25:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:21,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:25:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:25:21,464 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:21,711 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2024-11-02 12:25:21,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:25:21,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-02 12:25:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:21,713 INFO L225 Difference]: With dead ends: 177 [2024-11-02 12:25:21,713 INFO L226 Difference]: Without dead ends: 177 [2024-11-02 12:25:21,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02 12:25:21,715 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:21,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 401 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:25:21,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-02 12:25:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-02 12:25:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 90 states have (on average 1.9111111111111112) internal successors, (172), 163 states have internal predecessors, (172), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-02 12:25:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 198 transitions. [2024-11-02 12:25:21,726 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 198 transitions. Word has length 7 [2024-11-02 12:25:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:21,726 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 198 transitions. [2024-11-02 12:25:21,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:25:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 198 transitions. [2024-11-02 12:25:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-02 12:25:21,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:21,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:21,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 12:25:21,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:21,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:21,731 INFO L85 PathProgramCache]: Analyzing trace with hash -677941945, now seen corresponding path program 1 times [2024-11-02 12:25:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927538334] [2024-11-02 12:25:21,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:21,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:22,179 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-02 12:25:22,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:22,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927538334] [2024-11-02 12:25:22,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927538334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:22,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:22,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-02 12:25:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886620006] [2024-11-02 12:25:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:22,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-02 12:25:22,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-02 12:25:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:25:22,183 INFO L87 Difference]: Start difference. First operand 177 states and 198 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:25:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:22,907 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2024-11-02 12:25:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:25:22,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-02 12:25:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:22,909 INFO L225 Difference]: With dead ends: 176 [2024-11-02 12:25:22,909 INFO L226 Difference]: Without dead ends: 176 [2024-11-02 12:25:22,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-02 12:25:22,910 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 51 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:22,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 479 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-02 12:25:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-02 12:25:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-02 12:25:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 90 states have (on average 1.9) internal successors, (171), 162 states have internal predecessors, (171), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-02 12:25:22,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2024-11-02 12:25:22,915 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 13 [2024-11-02 12:25:22,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:22,917 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2024-11-02 12:25:22,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:25:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2024-11-02 12:25:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-02 12:25:22,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:22,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:22,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 12:25:22,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:22,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:22,919 INFO L85 PathProgramCache]: Analyzing trace with hash -677941944, now seen corresponding path program 1 times [2024-11-02 12:25:22,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:22,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327372952] [2024-11-02 12:25:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:22,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:23,312 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-02 12:25:23,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:23,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327372952] [2024-11-02 12:25:23,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327372952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:23,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:25:23,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:25:23,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493991456] [2024-11-02 12:25:23,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:23,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 12:25:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:23,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 12:25:23,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:25:23,319 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:25:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:23,831 INFO L93 Difference]: Finished difference Result 176 states and 198 transitions. [2024-11-02 12:25:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:25:23,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-02 12:25:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:23,834 INFO L225 Difference]: With dead ends: 176 [2024-11-02 12:25:23,834 INFO L226 Difference]: Without dead ends: 176 [2024-11-02 12:25:23,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:25:23,835 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 85 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:23,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 317 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-02 12:25:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-02 12:25:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2024-11-02 12:25:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 161 states have internal predecessors, (170), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-02 12:25:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 196 transitions. [2024-11-02 12:25:23,845 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 196 transitions. Word has length 13 [2024-11-02 12:25:23,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:23,846 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 196 transitions. [2024-11-02 12:25:23,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-02 12:25:23,846 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 196 transitions. [2024-11-02 12:25:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-02 12:25:23,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:23,847 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:23,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 12:25:23,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:23,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash -283995227, now seen corresponding path program 1 times [2024-11-02 12:25:23,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:23,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227679847] [2024-11-02 12:25:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:23,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 12:25:24,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:24,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227679847] [2024-11-02 12:25:24,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227679847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:25:24,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383118270] [2024-11-02 12:25:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:24,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:24,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:24,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:25:24,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 12:25:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:24,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-02 12:25:24,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:25:24,720 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-02 12:25:24,720 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 2 case distinctions, treesize of input 14 treesize of output 19 [2024-11-02 12:25:24,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and (or .cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))))) is different from false [2024-11-02 12:25:24,915 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and (or .cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))))) is different from true [2024-11-02 12:25:25,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (and (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|)))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))))) is different from false [2024-11-02 12:25:27,430 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (and (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)) (or .cse0 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1)))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|)))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))))) is different from true [2024-11-02 12:25:27,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1)))) (and (or .cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|)))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))))) is different from false [2024-11-02 12:25:29,670 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (or (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1)))) (and (or .cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)) (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|)))) (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))))))) is different from true [2024-11-02 12:25:29,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1))) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) .cse0) (and (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|))) .cse1) (and (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) .cse0) (and .cse1 (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1)))))) is different from false [2024-11-02 12:25:29,998 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|ULTIMATE.start_create_sll_~#list~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_create_sll_~#list~0#1.base|) 1))) (.cse1 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (or (and (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1))) .cse0) (and (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|))) .cse1) (and (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |v_old(#valid)_AFTER_CALL_2|) 1) |v_old(#valid)_AFTER_CALL_2|) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) .cse0) (and .cse1 (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_2| (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_2| (@diff |v_old(#valid)_AFTER_CALL_2| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_2| |chain_node_~node~0#1.base|) 1)))))) is different from true [2024-11-02 12:25:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-02 12:25:30,000 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-02 12:25:30,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383118270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:25:30,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-02 12:25:30,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2024-11-02 12:25:30,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825247920] [2024-11-02 12:25:30,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:25:30,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-02 12:25:30,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:25:30,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-02 12:25:30,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=121, Unknown=8, NotChecked=100, Total=272 [2024-11-02 12:25:30,002 INFO L87 Difference]: Start difference. First operand 175 states and 196 transitions. Second operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:25:30,191 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (let ((.cse1 (or .cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))) (and (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse1 (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)))) .cse1))) is different from false [2024-11-02 12:25:30,198 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_create_sll_~#list~0#1.base| |c_ULTIMATE.start_create_sll_~pp1#1.base|))) (let ((.cse1 (or .cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1)))) (and (or (and .cse0 (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_1| (Array Int Int))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_1| (@diff |v_old(#valid)_AFTER_CALL_1| |c_#valid|) 1)) (= (select |v_old(#valid)_AFTER_CALL_1| |c_ULTIMATE.start_create_sll_~pp1#1.base|) 1))) (and .cse1 (exists ((|chain_node_~node~0#1.base| Int)) (= (select |c_#valid| |chain_node_~node~0#1.base|) 1)))) .cse1))) is different from true [2024-11-02 12:25:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:25:31,178 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2024-11-02 12:25:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-02 12:25:31,179 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-02 12:25:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:25:31,180 INFO L225 Difference]: With dead ends: 189 [2024-11-02 12:25:31,181 INFO L226 Difference]: Without dead ends: 189 [2024-11-02 12:25:31,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=67, Invalid=183, Unknown=10, NotChecked=160, Total=420 [2024-11-02 12:25:31,182 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 105 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 922 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:25:31,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 366 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 478 Invalid, 0 Unknown, 922 Unchecked, 1.0s Time] [2024-11-02 12:25:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-02 12:25:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2024-11-02 12:25:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 98 states have (on average 1.846938775510204) internal successors, (181), 169 states have internal predecessors, (181), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-02 12:25:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 211 transitions. [2024-11-02 12:25:31,191 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 211 transitions. Word has length 25 [2024-11-02 12:25:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:25:31,192 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 211 transitions. [2024-11-02 12:25:31,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-02 12:25:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 211 transitions. [2024-11-02 12:25:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-02 12:25:31,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:25:31,193 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:25:31,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-02 12:25:31,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:31,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2024-11-02 12:25:31,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:25:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash -283995226, now seen corresponding path program 1 times [2024-11-02 12:25:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:25:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160326895] [2024-11-02 12:25:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:31,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:25:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-02 12:25:32,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:25:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160326895] [2024-11-02 12:25:32,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160326895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:25:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189860129] [2024-11-02 12:25:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:25:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:25:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:25:32,655 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:25:32,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170a5ed4-7db3-44c5-8551-024cbcbb1f96/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-02 12:25:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:25:32,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-02 12:25:32,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:25:32,862 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-02 12:25:32,863 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 1 case distinctions, treesize of input 9 treesize of output 11 [2024-11-02 12:25:32,882 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-02 12:25:32,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-02 12:25:32,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:25:32,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-02 12:25:32,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-02 12:25:32,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2024-11-02 12:25:32,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:25:32,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-02 12:25:32,998 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 9 treesize of output 5 [2024-11-02 12:25:33,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:25:33,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-11-02 12:25:33,081 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-02 12:25:33,081 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 7 [2024-11-02 12:25:33,187 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int)) (and (= |c_#length| (store |c_old(#length)| |chain_node_~node~0#1.base| (select |c_#length| |chain_node_~node~0#1.base|))) (<= (+ |chain_node_~node~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2024-11-02 12:25:33,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:25:33,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:25:33,265 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-02 12:25:33,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2024-11-02 12:25:33,292 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-02 12:25:33,292 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-02 12:25:33,432 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-02 12:25:33,432 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 7 [2024-11-02 12:25:33,472 WARN L873 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (<= (+ 1 |chain_node_alloc_node_~ptr~0#1.base|) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| (select |c_#length| |chain_node_alloc_node_~ptr~0#1.base|)) |c_#length|))) is different from true [2024-11-02 12:25:33,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-02 12:25:33,572 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-02 12:25:33,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-02 12:25:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-02 12:25:33,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:25:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189860129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:25:33,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [121706184] [2024-11-02 12:25:33,875 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-02 12:25:33,875 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:25:33,879 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:25:33,885 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:25:33,885 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:25:38,504 INFO L197 IcfgInterpreter]: Interpreting procedure chain_node with input of size 257 for LOIs [2024-11-02 12:25:40,338 INFO L180 IcfgInterpreter]: Interpretation finished