./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:59:07,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:59:08,014 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 05:59:08,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:59:08,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:59:08,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:59:08,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:59:08,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:59:08,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:59:08,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:59:08,066 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:59:08,067 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:59:08,067 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:59:08,067 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:59:08,070 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:59:08,070 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:59:08,071 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:59:08,071 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:59:08,071 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:59:08,072 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:59:08,072 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:59:08,073 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:59:08,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 05:59:08,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 05:59:08,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:59:08,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:59:08,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:59:08,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:59:08,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:59:08,076 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 05:59:08,076 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 05:59:08,077 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 05:59:08,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:59:08,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:59:08,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:59:08,078 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:59:08,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:59:08,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:59:08,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:59:08,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:59:08,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:59:08,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:59:08,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:59:08,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:59:08,081 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:59:08,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:59:08,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:59:08,082 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:59:08,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:59:08,082 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_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2024-11-09 05:59:08,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:59:08,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:59:08,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:59:08,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:59:08,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:59:08,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i Unable to find full path for "g++" [2024-11-09 05:59:10,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:59:10,637 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:59:10,638 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2024-11-09 05:59:10,653 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/data/bc85d2949/0269f60c8b594929b24c5d73d9a360e6/FLAG7c99f0666 [2024-11-09 05:59:10,979 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/data/bc85d2949/0269f60c8b594929b24c5d73d9a360e6 [2024-11-09 05:59:10,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:59:10,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:59:10,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:59:10,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:59:10,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:59:10,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:59:10" (1/1) ... [2024-11-09 05:59:10,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ede2d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:10, skipping insertion in model container [2024-11-09 05:59:10,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:59:10" (1/1) ... [2024-11-09 05:59:11,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:59:11,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:59:11,438 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:59:11,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:59:11,541 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:59:11,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11 WrapperNode [2024-11-09 05:59:11,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:59:11,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:59:11,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:59:11,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:59:11,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,604 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 138 [2024-11-09 05:59:11,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:59:11,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:59:11,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:59:11,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:59:11,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:59:11,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:59:11,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:59:11,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:59:11,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (1/1) ... [2024-11-09 05:59:11,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:59:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:59:11,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:59:11,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:59:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:59:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:59:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 05:59:11,741 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 05:59:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:59:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:59:11,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:59:11,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:59:11,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:59:11,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:59:11,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 05:59:11,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:59:11,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:59:11,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:59:11,926 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:59:11,929 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:59:12,355 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-09 05:59:12,355 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:59:12,407 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:59:12,407 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 05:59:12,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:59:12 BoogieIcfgContainer [2024-11-09 05:59:12,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:59:12,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:59:12,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:59:12,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:59:12,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:59:10" (1/3) ... [2024-11-09 05:59:12,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592a4b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:59:12, skipping insertion in model container [2024-11-09 05:59:12,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:59:11" (2/3) ... [2024-11-09 05:59:12,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@592a4b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:59:12, skipping insertion in model container [2024-11-09 05:59:12,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:59:12" (3/3) ... [2024-11-09 05:59:12,425 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2024-11-09 05:59:12,471 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:59:12,471 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-11-09 05:59:12,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:59:12,570 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;@45d8268, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:59:12,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-09 05:59:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 45 states have (on average 2.2) internal successors, (99), 84 states have internal predecessors, (99), 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-09 05:59:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:59:12,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:12,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:59:12,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:59:12,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1738123729, now seen corresponding path program 1 times [2024-11-09 05:59:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:12,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293009069] [2024-11-09 05:59:12,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:59:12,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:12,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293009069] [2024-11-09 05:59:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293009069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:59:12,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:59:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:59:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282109574] [2024-11-09 05:59:12,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:59:12,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:59:12,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:12,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:59:12,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:59:12,931 INFO L87 Difference]: Start difference. First operand has 88 states, 45 states have (on average 2.2) internal successors, (99), 84 states have internal predecessors, (99), 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-09 05:59:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:13,014 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2024-11-09 05:59:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:59:13,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-09 05:59:13,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:13,028 INFO L225 Difference]: With dead ends: 94 [2024-11-09 05:59:13,029 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 05:59:13,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:59:13,034 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:13,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 166 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:59:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 05:59:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-11-09 05:59:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 45 states have (on average 2.066666666666667) internal successors, (93), 83 states have internal predecessors, (93), 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-09 05:59:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-09 05:59:13,079 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 7 [2024-11-09 05:59:13,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:13,079 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-09 05:59:13,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-09 05:59:13,080 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-09 05:59:13,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:59:13,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:13,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:59:13,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:59:13,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:59:13,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:13,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2022065326, now seen corresponding path program 1 times [2024-11-09 05:59:13,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318648642] [2024-11-09 05:59:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:59:13,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318648642] [2024-11-09 05:59:13,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318648642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:59:13,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:59:13,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:59:13,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696493375] [2024-11-09 05:59:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:59:13,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:59:13,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:13,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:59:13,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:59:13,238 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-09 05:59:13,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:13,365 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-11-09 05:59:13,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:59:13,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-09 05:59:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:13,367 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:59:13,367 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 05:59:13,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:59:13,369 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:13,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 129 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:59:13,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 05:59:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 05:59:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 2.022222222222222) internal successors, (91), 81 states have internal predecessors, (91), 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-09 05:59:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2024-11-09 05:59:13,386 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 7 [2024-11-09 05:59:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:13,387 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2024-11-09 05:59:13,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-09 05:59:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2024-11-09 05:59:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:59:13,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:13,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:59:13,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:59:13,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:59:13,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:13,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2022065327, now seen corresponding path program 1 times [2024-11-09 05:59:13,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031802874] [2024-11-09 05:59:13,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:13,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:59:13,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:13,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031802874] [2024-11-09 05:59:13,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031802874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:59:13,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:59:13,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:59:13,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516677082] [2024-11-09 05:59:13,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:59:13,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:59:13,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:13,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:59:13,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:59:13,517 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-09 05:59:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:13,603 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2024-11-09 05:59:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:59:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-09 05:59:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:13,605 INFO L225 Difference]: With dead ends: 83 [2024-11-09 05:59:13,605 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 05:59:13,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:59:13,607 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:13,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 133 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:59:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 05:59:13,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 05:59:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 79 states have internal predecessors, (89), 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-09 05:59:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2024-11-09 05:59:13,615 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 7 [2024-11-09 05:59:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:13,615 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2024-11-09 05:59:13,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 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-09 05:59:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2024-11-09 05:59:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:59:13,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:13,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:59:13,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:59:13,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:59:13,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:13,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1918630015, now seen corresponding path program 1 times [2024-11-09 05:59:13,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:13,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645438473] [2024-11-09 05:59:13,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:13,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:59:13,882 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:13,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645438473] [2024-11-09 05:59:13,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645438473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:59:13,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:59:13,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:59:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184848447] [2024-11-09 05:59:13,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:59:13,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:59:13,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:13,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:59:13,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:59:13,886 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-09 05:59:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:14,069 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2024-11-09 05:59:14,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:59:14,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-09 05:59:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:14,071 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:59:14,071 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 05:59:14,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:59:14,072 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:14,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:59:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 05:59:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 05:59:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 45 states have (on average 1.9555555555555555) internal successors, (88), 78 states have internal predecessors, (88), 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-09 05:59:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2024-11-09 05:59:14,085 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 11 [2024-11-09 05:59:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:14,085 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2024-11-09 05:59:14,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-09 05:59:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2024-11-09 05:59:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:59:14,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:14,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:59:14,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:59:14,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:59:14,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1918630016, now seen corresponding path program 1 times [2024-11-09 05:59:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:14,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069549413] [2024-11-09 05:59:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:59:14,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069549413] [2024-11-09 05:59:14,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069549413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:59:14,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:59:14,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:59:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768156330] [2024-11-09 05:59:14,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:59:14,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:59:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:14,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:59:14,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:59:14,205 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-09 05:59:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:14,377 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2024-11-09 05:59:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:59:14,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-09 05:59:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:14,379 INFO L225 Difference]: With dead ends: 81 [2024-11-09 05:59:14,380 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 05:59:14,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:59:14,383 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:14,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 263 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:59:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 05:59:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 05:59:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.9333333333333333) internal successors, (87), 77 states have internal predecessors, (87), 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-09 05:59:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2024-11-09 05:59:14,397 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 11 [2024-11-09 05:59:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:14,397 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2024-11-09 05:59:14,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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-09 05:59:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2024-11-09 05:59:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:59:14,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:14,399 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:59:14,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:59:14,399 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:59:14,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:14,400 INFO L85 PathProgramCache]: Analyzing trace with hash -897004199, now seen corresponding path program 1 times [2024-11-09 05:59:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:14,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400980107] [2024-11-09 05:59:14,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:14,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:14,530 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 05:59:14,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:14,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400980107] [2024-11-09 05:59:14,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400980107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:59:14,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391790543] [2024-11-09 05:59:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:14,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:59:14,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:59:14,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:59:14,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:59:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:14,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:59:14,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:59:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:59:14,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:59:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 05:59:14,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391790543] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:59:14,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1036494934] [2024-11-09 05:59:14,823 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:59:14,823 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:59:14,827 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:59:14,833 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:59:14,833 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:59:16,840 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-09 05:59:17,426 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:59:25,599 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1079#(and (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_20| Int)) (and (or (and (exists ((|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_44| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_44|) (= |#memory_int| (store |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_63| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (= |v_ULTIMATE.start_sll_append_~head#1.base_20| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_9| (Array Int Int)) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_int)_AFTER_CALL_9|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (exists ((|v_#valid_86| (Array Int Int))) (and (= (store |v_#valid_86| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_63| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (exists ((|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_int_44| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_43| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_44|) (= |#memory_int| (store |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_44| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))))) (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_10| (Array Int Int)) (|v_#memory_int_47| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_67| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_67| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_47| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_17| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_10| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_63| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_63| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_75| (Array Int Int))) (= |#length| (store |v_#length_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (= |v_ULTIMATE.start_sll_append_~head#1.base_20| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_86| (Array Int Int))) (and (= (store |v_#valid_86| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_86| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_63| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_63| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))) (not (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_20|) 1)))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 05:59:25,599 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:59:25,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:59:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-09 05:59:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211252863] [2024-11-09 05:59:25,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:59:25,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 05:59:25,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:25,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 05:59:25,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=237, Unknown=1, NotChecked=0, Total=272 [2024-11-09 05:59:25,602 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:59:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:25,664 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-11-09 05:59:25,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:59:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-11-09 05:59:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:25,667 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:59:25,668 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 05:59:25,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=34, Invalid=237, Unknown=1, NotChecked=0, Total=272 [2024-11-09 05:59:25,669 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 3 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:25,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 220 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:59:25,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 05:59:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-09 05:59:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.8541666666666667) internal successors, (89), 80 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:59:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2024-11-09 05:59:25,684 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 21 [2024-11-09 05:59:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:25,684 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2024-11-09 05:59:25,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:59:25,684 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2024-11-09 05:59:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:59:25,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:25,689 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:59:25,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 05:59:25,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:59:25,890 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:59:25,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2008691281, now seen corresponding path program 2 times [2024-11-09 05:59:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720805380] [2024-11-09 05:59:25,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:25,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 05:59:26,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720805380] [2024-11-09 05:59:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720805380] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:59:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077871013] [2024-11-09 05:59:26,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:59:26,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:59:26,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:59:26,406 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:59:26,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:59:26,569 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 05:59:26,569 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:59:26,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 05:59:26,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:59:26,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:59:26,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 05:59:26,690 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:59:26,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 05:59:26,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 05:59:26,852 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 05:59:26,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 05:59:26,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 05:59:26,955 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2024-11-09 05:59:26,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:59:26,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:59:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 8 not checked. [2024-11-09 05:59:26,993 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:59:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077871013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:59:27,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1173815733] [2024-11-09 05:59:27,075 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:59:27,075 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:59:27,075 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:59:27,075 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:59:27,076 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:59:28,258 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-09 05:59:28,647 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:59:35,922 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1380#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_append_~data#1| 5) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_21| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_21|) 1)) (or (and (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_append_~head#1.base_21| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_56| (store |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int)) (|v_#length_BEFORE_CALL_33| (Array Int Int)) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_int_59| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_20| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_33| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_20| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#valid_99| (Array Int Int))) (and (= (store |v_#valid_99| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_99| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#length_82| (Array Int Int))) (= (store |v_#length_82| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_append_~head#1.base_21| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_56| (store |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_55| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_56| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (exists ((|v_#valid_99| (Array Int Int))) (and (= (store |v_#valid_99| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_99| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#length_82| (Array Int Int))) (= (store |v_#length_82| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int)) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_35| (Array Int Int)) (|v_#memory_int_59| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (store |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_79| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_#length_BEFORE_CALL_35| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 05:59:35,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:59:35,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:59:35,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 16 [2024-11-09 05:59:35,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095460993] [2024-11-09 05:59:35,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:59:35,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 05:59:35,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:35,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 05:59:35,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=831, Unknown=2, NotChecked=58, Total=992 [2024-11-09 05:59:35,925 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 18 states, 12 states have (on average 2.75) internal successors, (33), 14 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:59:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:36,344 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2024-11-09 05:59:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:59:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 2.75) internal successors, (33), 14 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2024-11-09 05:59:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:36,346 INFO L225 Difference]: With dead ends: 92 [2024-11-09 05:59:36,346 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 05:59:36,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=126, Invalid=998, Unknown=2, NotChecked=64, Total=1190 [2024-11-09 05:59:36,347 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 137 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:36,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 281 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 340 Invalid, 0 Unknown, 93 Unchecked, 0.3s Time] [2024-11-09 05:59:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 05:59:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2024-11-09 05:59:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 48 states have (on average 1.75) internal successors, (84), 75 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:59:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-11-09 05:59:36,354 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 31 [2024-11-09 05:59:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:36,354 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-11-09 05:59:36,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 2.75) internal successors, (33), 14 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:59:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-11-09 05:59:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:59:36,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:36,355 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:59:36,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:59:36,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:59:36,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:59:36,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:36,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2008691280, now seen corresponding path program 1 times [2024-11-09 05:59:36,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:36,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194908234] [2024-11-09 05:59:36,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:59:37,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194908234] [2024-11-09 05:59:37,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194908234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:59:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714151348] [2024-11-09 05:59:37,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:37,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:59:37,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:59:37,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:59:37,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:59:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:37,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 05:59:37,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:59:37,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:59:37,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 05:59:37,630 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2024-11-09 05:59:37,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:59:37,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:59:37,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 05:59:37,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:59:37,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:59:37,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 05:59:37,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:59:37,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 05:59:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 05:59:37,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:59:37,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714151348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:59:37,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:59:37,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2024-11-09 05:59:37,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802124832] [2024-11-09 05:59:37,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:59:37,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:59:37,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:37,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:59:37,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2024-11-09 05:59:37,866 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-09 05:59:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:38,004 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2024-11-09 05:59:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:59:38,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 31 [2024-11-09 05:59:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:38,005 INFO L225 Difference]: With dead ends: 77 [2024-11-09 05:59:38,005 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 05:59:38,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2024-11-09 05:59:38,006 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:38,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 225 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 98 Unchecked, 0.1s Time] [2024-11-09 05:59:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 05:59:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 05:59:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.6875) internal successors, (81), 72 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:59:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2024-11-09 05:59:38,011 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 31 [2024-11-09 05:59:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:38,012 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2024-11-09 05:59:38,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-09 05:59:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2024-11-09 05:59:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:59:38,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:38,013 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:59:38,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 05:59:38,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:59:38,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:59:38,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:38,214 INFO L85 PathProgramCache]: Analyzing trace with hash 857393606, now seen corresponding path program 1 times [2024-11-09 05:59:38,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:38,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193118541] [2024-11-09 05:59:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:38,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:59:38,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193118541] [2024-11-09 05:59:38,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193118541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:59:38,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503216394] [2024-11-09 05:59:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:38,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:59:38,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:59:38,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:59:38,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:59:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:39,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 05:59:39,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:59:39,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:59:39,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 05:59:39,386 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_35| Int)) (and (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_35| (select |c_#valid| |v_node_create_~temp~0#1.base_35|))) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_35| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_35|)) |c_#memory_$Pointer$.base|) (<= (+ |v_node_create_~temp~0#1.base_35| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_35|) 0))) is different from true [2024-11-09 05:59:39,414 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 05:59:39,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 05:59:39,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:59:39,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 05:59:39,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 05:59:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2024-11-09 05:59:39,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:59:39,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503216394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:59:39,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1591211200] [2024-11-09 05:59:39,610 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 05:59:39,610 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:59:39,610 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:59:39,611 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:59:39,611 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:59:40,819 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-09 05:59:41,224 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:59:51,170 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1977#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_23| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_23|) 0) |ULTIMATE.start_sll_append_~last~0#1.offset|) (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_23|) 1) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_23|) 0)) 1)) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_23|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_23|) 0) 0))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_append_~head#1.base_23|)) (or (and (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_int_68| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_68|))) (exists ((|v_#length_93| (Array Int Int))) (= (store |v_#length_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_old(#length)_AFTER_CALL_34| (Array Int Int)) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_34| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_91| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_34| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (and (<= 8 (select |v_old(#length)_AFTER_CALL_34| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select |v_#memory_$Pointer$.offset_91| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_34|) (= (select |v_old(#valid)_AFTER_CALL_34| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_int)_AFTER_CALL_34| (store |v_#memory_int_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_34| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (= |v_ULTIMATE.start_sll_append_~head#1.base_23| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_110| (Array Int Int))) (and (= (select |v_#valid_110| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_110| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_87| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_87| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_91| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_91| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_91| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|))) (and (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_67| (Array Int (Array Int Int))) (|v_#memory_int_68| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_68| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_68|))) (exists ((|v_#length_BEFORE_CALL_59| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_95| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_35| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_91| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_35| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_91| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_35| (store |v_#memory_int_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_71| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_35| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (store |v_#memory_$Pointer$.base_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_59| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_35| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (exists ((|v_#length_93| (Array Int Int))) (= (store |v_#length_93| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (= |v_ULTIMATE.start_sll_append_~head#1.base_23| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_110| (Array Int Int))) (and (= (select |v_#valid_110| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_110| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_87| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_87| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_91| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_91| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_91| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 05:59:51,171 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:59:51,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:59:51,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-11-09 05:59:51,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941555414] [2024-11-09 05:59:51,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:59:51,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 05:59:51,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:59:51,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 05:59:51,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1440, Unknown=1, NotChecked=76, Total=1640 [2024-11-09 05:59:51,174 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 24 states, 18 states have (on average 2.388888888888889) internal successors, (43), 21 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:59:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:59:52,032 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2024-11-09 05:59:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:59:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.388888888888889) internal successors, (43), 21 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-09 05:59:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:59:52,033 INFO L225 Difference]: With dead ends: 76 [2024-11-09 05:59:52,033 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 05:59:52,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=176, Invalid=1989, Unknown=1, NotChecked=90, Total=2256 [2024-11-09 05:59:52,034 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 78 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:59:52,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 549 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 618 Invalid, 0 Unknown, 85 Unchecked, 0.5s Time] [2024-11-09 05:59:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 05:59:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-09 05:59:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.653061224489796) internal successors, (81), 71 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:59:52,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-11-09 05:59:52,046 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 34 [2024-11-09 05:59:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:59:52,047 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-09 05:59:52,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.388888888888889) internal successors, (43), 21 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:59:52,047 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-11-09 05:59:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 05:59:52,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:59:52,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:59:52,073 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 05:59:52,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:59:52,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 05:59:52,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:59:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash 857393607, now seen corresponding path program 1 times [2024-11-09 05:59:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:59:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637176487] [2024-11-09 05:59:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:59:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:59:53,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:59:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637176487] [2024-11-09 05:59:53,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637176487] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:59:53,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765260997] [2024-11-09 05:59:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:59:53,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:59:53,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:59:53,193 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:59:53,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:59:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:59:53,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 05:59:53,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:59:53,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 05:59:53,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:59:53,818 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_44| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_44| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_44|))) (<= (+ |v_node_create_~temp~0#1.base_44| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_44| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_44|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_44|) 0) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_44| (select |c_#length| |v_node_create_~temp~0#1.base_44|)) |c_#length|))) is different from true [2024-11-09 05:59:53,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:59:53,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:59:53,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:59:53,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-09 05:59:53,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:59:53,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 05:59:53,876 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 05:59:53,877 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 15 treesize of output 15 [2024-11-09 05:59:53,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 05:59:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2024-11-09 05:59:53,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:59:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765260997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:59:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [276557985] [2024-11-09 05:59:54,234 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 05:59:54,234 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:59:54,234 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:59:54,234 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:59:54,234 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:59:55,282 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-09 05:59:55,530 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:00:10,408 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2307#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_25| Int)) (and (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 0) 0))) (or (and (exists ((|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_107| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_107| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_45| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_111| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (store |v_#memory_$Pointer$.base_111| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_111| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_old(#length)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_int)_AFTER_CALL_45| (store |v_#memory_int_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_45| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_107| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |v_ULTIMATE.start_sll_append_~head#1.base_25| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_119| (Array Int Int))) (and (= (store |v_#valid_119| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_119| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_80| (store |v_#memory_int_79| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_79| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (exists ((|v_#length_103| (Array Int Int))) (= |#length| (store |v_#length_103| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_103| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0)))))) (and (exists ((|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_107| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_107| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (= |v_ULTIMATE.start_sll_append_~head#1.base_25| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#valid_119| (Array Int Int))) (and (= (store |v_#valid_119| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_119| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_80| (store |v_#memory_int_79| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_79| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_80| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (exists ((|v_old(#memory_int)_AFTER_CALL_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_old(#length)_AFTER_CALL_46| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_111| (Array Int (Array Int Int))) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (store |v_#memory_$Pointer$.base_111| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_111| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_107| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_old(#length)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_int)_AFTER_CALL_46| (store |v_#memory_int_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_83| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_46| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_46| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#length_103| (Array Int Int))) (= |#length| (store |v_#length_103| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_103| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_103| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))))) (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 1) (or (< (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 0) 4) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 0)) (+ 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_25|) 0)))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_append_~head#1.base_25|)))) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:00:10,409 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:00:10,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:00:10,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2024-11-09 06:00:10,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581233866] [2024-11-09 06:00:10,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:00:10,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 06:00:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 06:00:10,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1927, Unknown=4, NotChecked=88, Total=2162 [2024-11-09 06:00:10,411 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 28 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 06:00:11,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:11,713 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2024-11-09 06:00:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 06:00:11,713 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2024-11-09 06:00:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:11,714 INFO L225 Difference]: With dead ends: 79 [2024-11-09 06:00:11,714 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 06:00:11,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=229, Invalid=2963, Unknown=4, NotChecked=110, Total=3306 [2024-11-09 06:00:11,716 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 82 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:11,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 649 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 562 Invalid, 0 Unknown, 88 Unchecked, 0.6s Time] [2024-11-09 06:00:11,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 06:00:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 06:00:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 74 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:00:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2024-11-09 06:00:11,720 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 34 [2024-11-09 06:00:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:11,721 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-11-09 06:00:11,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 24 states have internal predecessors, (48), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 06:00:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2024-11-09 06:00:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 06:00:11,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:11,722 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:00:11,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:00:11,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:00:11,926 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 06:00:11,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:11,927 INFO L85 PathProgramCache]: Analyzing trace with hash 809098834, now seen corresponding path program 1 times [2024-11-09 06:00:11,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:11,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749619982] [2024-11-09 06:00:11,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:11,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 06:00:12,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749619982] [2024-11-09 06:00:12,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749619982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:12,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:12,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:00:12,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006218879] [2024-11-09 06:00:12,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:12,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:00:12,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:12,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:00:12,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:00:12,132 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 7 states have internal predecessors, (17), 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-09 06:00:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:12,233 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2024-11-09 06:00:12,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:00:12,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 7 states have internal predecessors, (17), 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 35 [2024-11-09 06:00:12,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:12,235 INFO L225 Difference]: With dead ends: 77 [2024-11-09 06:00:12,235 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 06:00:12,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:00:12,236 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 86 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:12,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 124 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:00:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 06:00:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 06:00:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.5769230769230769) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:00:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2024-11-09 06:00:12,245 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 35 [2024-11-09 06:00:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:12,245 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2024-11-09 06:00:12,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 7 states have internal predecessors, (17), 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-09 06:00:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2024-11-09 06:00:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 06:00:12,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:12,246 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:00:12,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:00:12,247 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 06:00:12,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash -687736256, now seen corresponding path program 1 times [2024-11-09 06:00:12,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:12,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412836415] [2024-11-09 06:00:12,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:12,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 06:00:12,494 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:12,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412836415] [2024-11-09 06:00:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412836415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:12,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:00:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618650457] [2024-11-09 06:00:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:12,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:00:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:12,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:00:12,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:00:12,497 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:00:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:12,694 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2024-11-09 06:00:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:00:12,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-09 06:00:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:12,696 INFO L225 Difference]: With dead ends: 123 [2024-11-09 06:00:12,696 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 06:00:12,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:00:12,697 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:12,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 224 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:00:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 06:00:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2024-11-09 06:00:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 73 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:00:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2024-11-09 06:00:12,702 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 36 [2024-11-09 06:00:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:12,702 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2024-11-09 06:00:12,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:00:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2024-11-09 06:00:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 06:00:12,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:12,704 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:00:12,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:00:12,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 06:00:12,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:12,705 INFO L85 PathProgramCache]: Analyzing trace with hash -687736255, now seen corresponding path program 1 times [2024-11-09 06:00:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:12,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361082381] [2024-11-09 06:00:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 06:00:13,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361082381] [2024-11-09 06:00:13,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361082381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:13,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:00:13,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:00:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123788289] [2024-11-09 06:00:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:13,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:00:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:00:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:00:13,171 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 9 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:00:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:13,382 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2024-11-09 06:00:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:00:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-09 06:00:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:13,383 INFO L225 Difference]: With dead ends: 122 [2024-11-09 06:00:13,383 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 06:00:13,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:00:13,384 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 65 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:13,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 264 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:00:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 06:00:13,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2024-11-09 06:00:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 79 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:00:13,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 98 transitions. [2024-11-09 06:00:13,389 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 98 transitions. Word has length 36 [2024-11-09 06:00:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:13,390 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 98 transitions. [2024-11-09 06:00:13,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 06:00:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 98 transitions. [2024-11-09 06:00:13,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 06:00:13,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:13,391 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:00:13,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:00:13,391 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 06:00:13,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash 442431879, now seen corresponding path program 1 times [2024-11-09 06:00:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:13,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563480761] [2024-11-09 06:00:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:13,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:00:15,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:15,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563480761] [2024-11-09 06:00:15,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563480761] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:00:15,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640734841] [2024-11-09 06:00:15,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:15,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:00:15,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:00:15,056 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:00:15,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:00:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:15,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 83 conjuncts are in the unsatisfiable core [2024-11-09 06:00:15,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:00:15,685 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:00:15,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 06:00:15,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 06:00:15,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:00:15,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 14 [2024-11-09 06:00:15,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:00:16,090 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_55| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_55| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_55|)) |c_#memory_$Pointer$.base|) (= |c_#valid| (store |c_old(#valid)| |v_node_create_~temp~0#1.base_55| 1)) (= 0 (select |c_old(#valid)| |v_node_create_~temp~0#1.base_55|)) (<= (+ |v_node_create_~temp~0#1.base_55| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_55| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_55|)) |c_#memory_$Pointer$.offset|))) is different from true [2024-11-09 06:00:16,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:00:16,120 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 06:00:16,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2024-11-09 06:00:16,161 INFO L349 Elim1Store]: treesize reduction 92, result has 31.9 percent of original size [2024-11-09 06:00:16,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 57 [2024-11-09 06:00:16,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:00:16,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:00:16,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:00:16,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:00:16,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 25 [2024-11-09 06:00:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 06:00:16,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:00:16,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640734841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:00:16,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [947779575] [2024-11-09 06:00:16,854 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 06:00:16,854 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:00:16,854 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:00:16,854 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:00:16,854 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:00:18,096 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-09 06:00:18,309 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:00:30,361 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3272#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_38| Int)) (and (or (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_27| Int)) (and (<= 4 (select |#length| |v_ULTIMATE.start_sll_append_~head#1.base_27|)) (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_27|) 1) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_27|) 0)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_27|) 0) |ULTIMATE.start_sll_append_~last~0#1.offset|) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_27|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_27|) 0) 0))) (or (and (exists ((|v_#valid_130| (Array Int Int))) (and (= (store |v_#valid_130| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_130| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_int_91| (Array Int (Array Int Int))) (|v_#memory_int_92| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_92| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_92| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_92| (store |v_#memory_int_91| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_91| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_92| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_110| (Array Int Int))) (= |#length| (store |v_#length_110| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_56| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_56| (Array Int Int)) (|v_#memory_$Pointer$.base_128| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_56| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_56| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_123| (Array Int (Array Int Int)))) (and (<= 8 (select |v_old(#length)_AFTER_CALL_56| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_56| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_123| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.base_128| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_128| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_56|) (= |v_old(#memory_int)_AFTER_CALL_56| (store |v_#memory_int_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_56| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (= |v_ULTIMATE.start_sll_append_~head#1.base_27| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_124| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_124| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_124| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|))) (and (exists ((|v_#valid_130| (Array Int Int))) (and (= (store |v_#valid_130| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_130| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_int_91| (Array Int (Array Int Int))) (|v_#memory_int_92| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_92| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_92| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_92| (store |v_#memory_int_91| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_91| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_92| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4)))))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_57| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_57| (Array Int Int)) (|v_#memory_$Pointer$.base_128| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_97| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_57| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_123| (Array Int (Array Int Int)))) (and (<= 8 (select |v_#length_BEFORE_CALL_97| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_57| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select (select |v_#memory_$Pointer$.offset_123| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_57| (store |v_#memory_int_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_57| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_57| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_57| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_57| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= 1 (select |v_old(#valid)_AFTER_CALL_57| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_57| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_57| (store |v_#memory_$Pointer$.base_128| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_57| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_128| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_57| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_57| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_57| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_110| (Array Int Int))) (= |#length| (store |v_#length_110| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (= |v_ULTIMATE.start_sll_append_~head#1.base_27| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_124| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_124| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_124| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)))))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_37| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_32| Int)) (and (<= (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_32| 8) (select |#length| |v_ULTIMATE.start_sll_append_~last~0#1.base_37|)) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_38| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_37|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_32| 4))) (<= 0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_32| 4)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_37|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_32| 4)) |ULTIMATE.start_sll_append_~last~0#1.offset|) (= (select |#valid| |v_ULTIMATE.start_sll_append_~last~0#1.base_37|) 1)))) (not (= (select |#valid| |v_ULTIMATE.start_sll_append_~last~0#1.base_38|) 1)))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:00:30,361 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:00:30,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:00:30,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 38 [2024-11-09 06:00:30,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940052809] [2024-11-09 06:00:30,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:00:30,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 06:00:30,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:30,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 06:00:30,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3216, Unknown=2, NotChecked=114, Total=3540 [2024-11-09 06:00:30,365 INFO L87 Difference]: Start difference. First operand 84 states and 98 transitions. Second operand has 39 states, 30 states have (on average 2.066666666666667) internal successors, (62), 32 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:00:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:32,162 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2024-11-09 06:00:32,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 06:00:32,163 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 2.066666666666667) internal successors, (62), 32 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-09 06:00:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:32,164 INFO L225 Difference]: With dead ends: 92 [2024-11-09 06:00:32,164 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 06:00:32,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=342, Invalid=4916, Unknown=2, NotChecked=142, Total=5402 [2024-11-09 06:00:32,166 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 150 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:32,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 942 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 966 Invalid, 0 Unknown, 97 Unchecked, 0.8s Time] [2024-11-09 06:00:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 06:00:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2024-11-09 06:00:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.492063492063492) internal successors, (94), 80 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:00:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2024-11-09 06:00:32,169 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 37 [2024-11-09 06:00:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:32,170 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2024-11-09 06:00:32,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 2.066666666666667) internal successors, (62), 32 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:00:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2024-11-09 06:00:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 06:00:32,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:32,171 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:00:32,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:00:32,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 06:00:32,372 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 06:00:32,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash 442431880, now seen corresponding path program 1 times [2024-11-09 06:00:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:32,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235090989] [2024-11-09 06:00:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:32,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:00:34,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:34,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235090989] [2024-11-09 06:00:34,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235090989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:00:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783782699] [2024-11-09 06:00:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:34,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:00:34,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:00:34,219 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:00:34,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 06:00:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:34,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-09 06:00:34,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:00:34,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:00:34,836 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:00:34,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 06:00:34,869 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 06:00:34,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 06:00:35,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 06:00:35,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:00:35,253 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-09 06:00:35,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 36 [2024-11-09 06:00:35,273 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-09 06:00:35,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2024-11-09 06:00:35,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:00:35,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 06:00:35,490 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_66| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_66| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_66| (select |c_#length| |v_node_create_~temp~0#1.base_66|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_66| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_66|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_66| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_66|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_66|) 0))) is different from true [2024-11-09 06:00:35,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:00:35,528 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 06:00:35,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2024-11-09 06:00:35,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:00:35,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:00:35,543 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:00:35,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2024-11-09 06:00:35,570 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-09 06:00:35,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 06:00:35,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-09 06:00:35,819 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-09 06:00:35,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 29 [2024-11-09 06:00:35,833 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2024-11-09 06:00:35,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2024-11-09 06:00:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 06:00:35,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:00:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783782699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:00:36,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [312213364] [2024-11-09 06:00:36,278 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 06:00:36,278 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:00:36,278 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:00:36,278 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:00:36,278 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:00:37,598 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-09 06:00:37,902 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:00:54,919 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3675#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.offset_39| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.base_45| Int)) (and (or (< (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_39| 4) 0) (< (select |#length| |v_ULTIMATE.start_sll_append_~last~0#1.base_45|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_39| 8))) (or (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_29| Int)) (and (or (and (= |v_ULTIMATE.start_sll_append_~head#1.base_29| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_117| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_67| (Array Int Int)) (|v_#memory_$Pointer$.offset_140| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_67| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_145| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_67| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_67| (store |v_#memory_$Pointer$.base_145| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_67| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_145| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_67| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_67| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_67| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= (select (select |v_#memory_$Pointer$.offset_140| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_67| (store |v_#memory_int_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_67| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_67| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_67| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_67| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_117| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_67| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_141| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_141| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_141| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_104| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_104| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_104| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_103| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_103| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_104| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_104|))) (exists ((|v_#length_122| (Array Int Int))) (= |#length| (store |v_#length_122| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_136| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_136| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_136| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_140| (Array Int Int))) (and (= (select |v_#valid_140| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_140| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|)))) (and (= |v_ULTIMATE.start_sll_append_~head#1.base_29| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_141| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_141| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_141| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_68| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#memory_$Pointer$.offset_140| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_68| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_145| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_119| (Array Int Int))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_68| (store |v_#memory_$Pointer$.base_145| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_68| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_145| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_68| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_68| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_68| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_#memory_$Pointer$.offset_140| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_68| (store |v_#memory_int_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_68| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_107| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_68| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_68| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_68| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (<= 8 (select |v_#length_BEFORE_CALL_119| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_68| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_68| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_68| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1))) (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_104| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_104| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_104| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_103| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_103| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_104| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_104|))) (exists ((|v_#length_122| (Array Int Int))) (= |#length| (store |v_#length_122| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_136| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_136| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_136| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_140| (Array Int Int))) (and (= (select |v_#valid_140| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_140| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))))) (or (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_29|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_29|) 0) 0))) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_45| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_29|) 0)) (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_29|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_sll_append_~head#1.base_29|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_29|) 0) |v_ULTIMATE.start_sll_append_~last~0#1.offset_39|))) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_44| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_38| Int)) (and (= (select |#valid| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) 1) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_38| 4)) |v_ULTIMATE.start_sll_append_~last~0#1.offset_39|) (<= 0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_38| 4)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_38| 4)) |v_ULTIMATE.start_sll_append_~last~0#1.base_45|) (<= (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_38| 8) (select |#length| |v_ULTIMATE.start_sll_append_~last~0#1.base_44|))))))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:00:54,920 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:00:54,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:00:54,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 40 [2024-11-09 06:00:54,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464776476] [2024-11-09 06:00:54,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:00:54,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 06:00:54,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:54,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 06:00:54,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3577, Unknown=6, NotChecked=120, Total=3906 [2024-11-09 06:00:54,922 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 41 states, 32 states have (on average 1.84375) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:00:57,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:00:57,572 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2024-11-09 06:00:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 06:00:57,572 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.84375) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-09 06:00:57,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:00:57,573 INFO L225 Difference]: With dead ends: 92 [2024-11-09 06:00:57,573 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 06:00:57,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=341, Invalid=5356, Unknown=7, NotChecked=148, Total=5852 [2024-11-09 06:00:57,575 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 89 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:00:57,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1029 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1484 Invalid, 0 Unknown, 94 Unchecked, 1.3s Time] [2024-11-09 06:00:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 06:00:57,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-11-09 06:00:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.476923076923077) internal successors, (96), 82 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:00:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2024-11-09 06:00:57,580 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 37 [2024-11-09 06:00:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:00:57,581 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2024-11-09 06:00:57,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.84375) internal successors, (59), 34 states have internal predecessors, (59), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:00:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2024-11-09 06:00:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 06:00:57,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:00:57,583 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:00:57,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 06:00:57,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 06:00:57,784 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 06:00:57,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:00:57,784 INFO L85 PathProgramCache]: Analyzing trace with hash -26490043, now seen corresponding path program 1 times [2024-11-09 06:00:57,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:00:57,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157404483] [2024-11-09 06:00:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:00:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:00:58,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:00:58,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157404483] [2024-11-09 06:00:58,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157404483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:00:58,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977826734] [2024-11-09 06:00:58,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:00:58,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:00:58,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:00:58,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:00:58,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 06:00:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:00:58,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 06:00:58,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:00:58,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:00:58,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 06:00:58,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:00:58,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 06:00:58,833 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-11-09 06:00:58,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 06:00:58,950 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-11-09 06:00:58,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2024-11-09 06:00:59,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:00:59,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 51 [2024-11-09 06:00:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:00:59,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:00:59,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977826734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:00:59,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:00:59,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 30 [2024-11-09 06:00:59,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812960830] [2024-11-09 06:00:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:00:59,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 06:00:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:00:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 06:00:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2024-11-09 06:00:59,131 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:01:01,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:01:03,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:01:05,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:01:05,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:05,799 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2024-11-09 06:01:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 06:01:05,799 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-09 06:01:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:05,800 INFO L225 Difference]: With dead ends: 128 [2024-11-09 06:01:05,800 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 06:01:05,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 06:01:05,801 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 195 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:05,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 550 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 610 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2024-11-09 06:01:05,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 06:01:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 86. [2024-11-09 06:01:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 81 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:01:05,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2024-11-09 06:01:05,805 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 39 [2024-11-09 06:01:05,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:05,805 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2024-11-09 06:01:05,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:01:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2024-11-09 06:01:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 06:01:05,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:05,806 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:01:05,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 06:01:06,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 06:01:06,007 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 06:01:06,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash -26490042, now seen corresponding path program 1 times [2024-11-09 06:01:06,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:06,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874866285] [2024-11-09 06:01:06,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:06,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:01:06,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:06,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874866285] [2024-11-09 06:01:06,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874866285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:06,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954379565] [2024-11-09 06:01:06,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:06,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:06,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:01:06,949 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:01:06,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 06:01:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:07,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 06:01:07,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:01:07,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:01:07,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 06:01:07,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:01:07,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:07,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:01:07,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:07,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-09 06:01:07,672 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 06:01:07,673 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 15 treesize of output 15 [2024-11-09 06:01:07,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 06:01:07,918 INFO L349 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2024-11-09 06:01:07,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 33 [2024-11-09 06:01:07,936 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 06:01:07,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 06:01:08,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:01:08,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 68 [2024-11-09 06:01:08,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:01:08,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 62 [2024-11-09 06:01:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:01:08,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:01:08,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954379565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:01:08,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:01:08,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 31 [2024-11-09 06:01:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842120962] [2024-11-09 06:01:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:01:08,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 06:01:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:01:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 06:01:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-11-09 06:01:08,260 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:01:10,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:01:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:11,149 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2024-11-09 06:01:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 06:01:11,149 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2024-11-09 06:01:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:11,150 INFO L225 Difference]: With dead ends: 127 [2024-11-09 06:01:11,150 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 06:01:11,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 06:01:11,151 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 126 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:11,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 780 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 731 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 06:01:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 06:01:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 80. [2024-11-09 06:01:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.45) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:01:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2024-11-09 06:01:11,155 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 39 [2024-11-09 06:01:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:11,155 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2024-11-09 06:01:11,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:01:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2024-11-09 06:01:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 06:01:11,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:11,157 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:01:11,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 06:01:11,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 06:01:11,357 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 06:01:11,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:11,358 INFO L85 PathProgramCache]: Analyzing trace with hash -766499290, now seen corresponding path program 2 times [2024-11-09 06:01:11,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:11,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180923668] [2024-11-09 06:01:11,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:11,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:01:13,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:13,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180923668] [2024-11-09 06:01:13,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180923668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:13,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731150698] [2024-11-09 06:01:13,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:01:13,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:13,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:01:13,613 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:01:13,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 06:01:13,828 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 06:01:13,828 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:01:13,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 123 conjuncts are in the unsatisfiable core [2024-11-09 06:01:13,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:01:13,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:01:13,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:01:13,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:01:14,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:01:14,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 06:01:14,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:01:14,501 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:01:14,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 06:01:14,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:01:14,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:01:14,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-09 06:01:14,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-09 06:01:15,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:15,059 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 06:01:15,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 45 [2024-11-09 06:01:15,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:15,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:01:15,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 10 [2024-11-09 06:01:15,297 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_81| Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |v_node_create_~temp~0#1.base_81| (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_81|))) (= (store |c_old(#length)| |v_node_create_~temp~0#1.base_81| (select |c_#length| |v_node_create_~temp~0#1.base_81|)) |c_#length|) (<= (+ |v_node_create_~temp~0#1.base_81| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_81|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_81| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_81|))))) is different from true [2024-11-09 06:01:15,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:15,355 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-09 06:01:15,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 88 [2024-11-09 06:01:15,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:15,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:15,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:15,377 INFO L349 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2024-11-09 06:01:15,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 47 [2024-11-09 06:01:15,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:15,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 06:01:15,416 INFO L349 Elim1Store]: treesize reduction 8, result has 74.2 percent of original size [2024-11-09 06:01:15,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2024-11-09 06:01:15,817 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 06:01:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 06:01:16,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:01:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731150698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [464106399] [2024-11-09 06:01:17,160 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 06:01:17,160 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:01:17,160 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:01:17,160 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:01:17,161 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:01:18,271 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 117 for LOIs [2024-11-09 06:01:18,522 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:01:26,377 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4844#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_55| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_sll_append_~last~0#1.base_55|) 1)) (or (exists ((|v_ULTIMATE.start_sll_append_~last~0#1.base_54| Int) (|v_ULTIMATE.start_sll_append_~last~0#1.offset_48| Int)) (and (<= (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| 8) (select |#length| |v_ULTIMATE.start_sll_append_~last~0#1.base_54|)) (= (select |#valid| |v_ULTIMATE.start_sll_append_~last~0#1.base_54|) 1) (<= 0 (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| 4)) (= |ULTIMATE.start_sll_append_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~last~0#1.base_54|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| 4))) (= |v_ULTIMATE.start_sll_append_~last~0#1.base_55| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~last~0#1.base_54|) (+ |v_ULTIMATE.start_sll_append_~last~0#1.offset_48| 4))))) (exists ((|v_ULTIMATE.start_sll_append_~head#1.base_31| Int)) (and (<= 4 (select |#length| |v_ULTIMATE.start_sll_append_~head#1.base_31|)) (= (select |#valid| |v_ULTIMATE.start_sll_append_~head#1.base_31|) 1) (= |ULTIMATE.start_sll_append_~last~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_31|) 0)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_31|) 0) |v_ULTIMATE.start_sll_append_~last~0#1.base_55|) (or (and (exists ((|v_#valid_154| (Array Int Int))) (and (= (select |v_#valid_154| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_154| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_116| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_116| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_115| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_115| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_116| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_116|))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_137| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_137| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_135| (Array Int Int))) (= (store |v_#length_135| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_167| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_167| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_167| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_161| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_161| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (= |v_ULTIMATE.start_sll_append_~head#1.base_31| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_#valid_154| (Array Int Int))) (and (= (select |v_#valid_154| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0) (= (store |v_#valid_154| |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#memory_int_115| (Array Int (Array Int Int))) (|v_#memory_int_116| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_116| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_116| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_115| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (select |v_#memory_int_115| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_116| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4))) |v_#memory_int_116|))) (<= (+ |ULTIMATE.start_sll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_135| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_135| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_append_~new_last~0#1.base| 0)) (exists ((|v_#length_135| (Array Int Int))) (= (store |v_#length_135| |ULTIMATE.start_sll_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_167| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_167| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_167| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_161| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_161| |ULTIMATE.start_sll_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_161| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_append_~new_last~0#1.base|) 0))))) (= |v_ULTIMATE.start_sll_append_~head#1.base_31| |ULTIMATE.start_main_~#s~0#1.base|))) (or (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_31|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~head#1.base_31|) 0) 0)))))))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_sll_append_~data#1| 5) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:01:26,377 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:01:26,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:01:26,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 47 [2024-11-09 06:01:26,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523201489] [2024-11-09 06:01:26,378 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:01:26,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 06:01:26,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:01:26,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 06:01:26,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=4589, Unknown=2, NotChecked=136, Total=4970 [2024-11-09 06:01:26,380 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 47 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:01:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:01:28,989 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2024-11-09 06:01:28,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 06:01:28,989 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-09 06:01:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:01:28,990 INFO L225 Difference]: With dead ends: 103 [2024-11-09 06:01:28,990 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 06:01:28,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=316, Invalid=5848, Unknown=2, NotChecked=154, Total=6320 [2024-11-09 06:01:28,991 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 21 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:01:28,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1291 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1317 Invalid, 0 Unknown, 106 Unchecked, 1.5s Time] [2024-11-09 06:01:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 06:01:28,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 96. [2024-11-09 06:01:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 89 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 06:01:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2024-11-09 06:01:28,995 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 40 [2024-11-09 06:01:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:01:28,996 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2024-11-09 06:01:28,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 06:01:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2024-11-09 06:01:28,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 06:01:28,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:01:28,997 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:01:29,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-09 06:01:29,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 06:01:29,198 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 06:01:29,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:01:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1861202927, now seen corresponding path program 1 times [2024-11-09 06:01:29,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:01:29,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694968306] [2024-11-09 06:01:29,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:29,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:01:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:01:29,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:01:29,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694968306] [2024-11-09 06:01:29,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694968306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:29,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39590881] [2024-11-09 06:01:29,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:01:29,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:01:29,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:01:29,615 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:01:29,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 06:01:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:01:29,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:01:29,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:01:29,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 06:01:29,912 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_91| Int)) (and (<= (+ |v_node_create_~temp~0#1.base_91| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_91| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_91|)) |c_#memory_$Pointer$.base|))) is different from true [2024-11-09 06:01:29,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:01:29,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 06:01:29,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 06:01:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2024-11-09 06:01:29,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:01:30,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39590881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:01:30,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [809375653] [2024-11-09 06:01:30,013 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 06:01:30,013 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:01:30,013 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:01:30,013 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:01:30,013 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:01:31,373 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 138 for LOIs [2024-11-09 06:01:31,702 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:02:16,295 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5256#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (exists ((|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_189| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_append_~head#1.base_33| Int) (|v_#memory_$Pointer$.offset_179| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_133| |v_ULTIMATE.start_sll_append_~head#1.base_33| (store (select |v_#memory_int_133| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)))) (or (and (= |v_ULTIMATE.start_sll_append_~head#1.base_33| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) (store (select |v_#memory_int_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 0 5)) |v_#memory_int_133|) (= (store |v_#memory_int_128| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) (store (select |v_#memory_int_128| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 4 (select (select |v_#memory_int_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 4))) |v_#memory_int_129|))) (exists ((|v_#valid_161| (Array Int Int))) (and (= (store |v_#valid_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 1) |#valid|) (= (select |v_#valid_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 0))) (exists ((|v_#length_BEFORE_CALL_159| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_96| (Array Int Int)) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_96| (Array Int (Array Int Int))) (|v_#memory_int_132| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_188| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_178| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 8 (select |v_#length_BEFORE_CALL_159| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (select |v_old(#valid)_AFTER_CALL_96| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (= |v_old(#memory_int)_AFTER_CALL_96| (store |v_#memory_int_132| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_132| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_96| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| (store |v_#memory_$Pointer$.base_188| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_188| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_96| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))))) (exists ((|v_#memory_$Pointer$.offset_174| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_179| (store |v_#memory_$Pointer$.offset_174| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) (store (store (select |v_#memory_$Pointer$.offset_174| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_179| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 0))))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_184| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) (store (store (select |v_#memory_$Pointer$.base_184| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_189| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 0))) |v_#memory_$Pointer$.base_189|)) (exists ((|v_#length_142| (Array Int Int))) (= |#length| (store |v_#length_142| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 8)))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_95| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_95| (Array Int Int)) (|v_#memory_int_132| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_95| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_95| (Array Int Int)) (|v_#memory_$Pointer$.offset_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_188| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_$Pointer$.offset_178| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_95| (store |v_#memory_int_132| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_95| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_int_132| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_95| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_int)_AFTER_CALL_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_95| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select |v_old(#valid)_AFTER_CALL_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_95| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 1) (<= 8 (select |v_old(#length)_AFTER_CALL_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_95| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= (store |v_#memory_$Pointer$.base_188| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_95| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_188| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_95| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_95| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_95| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_95|))) (= |v_ULTIMATE.start_sll_append_~head#1.base_33| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) (store (select |v_#memory_int_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 0 5)) |v_#memory_int_133|) (= (store |v_#memory_int_128| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) (store (select |v_#memory_int_128| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 4 (select (select |v_#memory_int_129| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 4))) |v_#memory_int_129|))) (exists ((|v_#valid_161| (Array Int Int))) (and (= (store |v_#valid_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 1) |#valid|) (= (select |v_#valid_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 0))) (exists ((|v_#memory_$Pointer$.offset_174| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_179| (store |v_#memory_$Pointer$.offset_174| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) (store (store (select |v_#memory_$Pointer$.offset_174| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.offset_179| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 0))))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 1) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_184| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_184| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) (store (store (select |v_#memory_$Pointer$.base_184| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 4 0) 0 (select (select |v_#memory_$Pointer$.base_189| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)) 0))) |v_#memory_$Pointer$.base_189|)) (exists ((|v_#length_142| (Array Int Int))) (= |#length| (store |v_#length_142| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 8))))) (= (select (select |v_#memory_$Pointer$.base_189| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_189| |v_ULTIMATE.start_sll_append_~head#1.base_33| (store (select |v_#memory_$Pointer$.base_189| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_179| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_179| |v_ULTIMATE.start_sll_append_~head#1.base_33| (store (select |v_#memory_$Pointer$.offset_179| |v_ULTIMATE.start_sll_append_~head#1.base_33|) 0 0))))) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 06:02:16,296 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:02:16,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:02:16,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2024-11-09 06:02:16,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938422578] [2024-11-09 06:02:16,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 06:02:16,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 06:02:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:02:16,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 06:02:16,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1219, Unknown=15, NotChecked=70, Total=1406 [2024-11-09 06:02:16,298 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:02:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:02:18,070 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2024-11-09 06:02:18,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:02:18,071 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2024-11-09 06:02:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:02:18,072 INFO L225 Difference]: With dead ends: 95 [2024-11-09 06:02:18,072 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 06:02:18,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 45.7s TimeCoverageRelationStatistics Valid=141, Invalid=1654, Unknown=15, NotChecked=82, Total=1892 [2024-11-09 06:02:18,074 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 60 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:02:18,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 430 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 74 Unchecked, 0.9s Time] [2024-11-09 06:02:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 06:02:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 06:02:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 06:02:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2024-11-09 06:02:18,078 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 41 [2024-11-09 06:02:18,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:02:18,078 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2024-11-09 06:02:18,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 15 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 06:02:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2024-11-09 06:02:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 06:02:18,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:02:18,079 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:02:18,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 06:02:18,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:18,280 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-09 06:02:18,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:02:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash 780713482, now seen corresponding path program 1 times [2024-11-09 06:02:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:02:18,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387997648] [2024-11-09 06:02:18,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:18,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:02:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 06:02:20,773 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:02:20,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387997648] [2024-11-09 06:02:20,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387997648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:20,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13306591] [2024-11-09 06:02:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:02:20,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:02:20,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:02:20,776 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:02:20,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee02cb8a-1b9d-4725-bd86-5c155ca55586/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 06:02:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:02:20,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-09 06:02:20,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:02:21,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:02:21,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 06:02:21,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:21,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 06:02:22,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 06:02:23,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:23,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 06:02:24,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 06:02:25,184 INFO L349 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2024-11-09 06:02:25,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 27 [2024-11-09 06:02:25,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:02:25,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 06:02:25,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 06:02:26,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:26,502 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 06:02:26,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 61 [2024-11-09 06:02:26,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:26,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2024-11-09 06:02:26,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:02:26,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 06:02:26,638 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 06:02:26,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 06:02:27,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:02:27,655 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 13 treesize of output 17 [2024-11-09 06:02:28,672 INFO L349 Elim1Store]: treesize reduction 65, result has 29.3 percent of original size [2024-11-09 06:02:28,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 58 [2024-11-09 06:02:28,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 53 [2024-11-09 06:02:30,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:02:30,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 115 [2024-11-09 06:02:30,659 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-09 06:02:30,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 25 [2024-11-09 06:02:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:02:30,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:02:34,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13306591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:02:34,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [444606871] [2024-11-09 06:02:34,308 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2024-11-09 06:02:34,308 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:02:34,309 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:02:34,309 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:02:34,309 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:02:40,891 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 98 for LOIs [2024-11-09 06:02:40,994 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:04:36,165 WARN L286 SmtUtils]: Spent 13.34s on a formula simplification. DAG size of input: 264 DAG size of output: 252 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:05:18,225 WARN L286 SmtUtils]: Spent 11.62s on a formula simplification. DAG size of input: 262 DAG size of output: 250 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:05:44,685 WARN L286 SmtUtils]: Spent 13.98s on a formula simplification. DAG size of input: 276 DAG size of output: 260 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:06:17,357 WARN L286 SmtUtils]: Spent 14.87s on a formula simplification. DAG size of input: 291 DAG size of output: 269 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:06:17,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [444606871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:06:17,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 06:06:17,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [19, 25] total 64 [2024-11-09 06:06:17,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871944789] [2024-11-09 06:06:17,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:06:17,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 06:06:17,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:06:17,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 06:06:17,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=4717, Unknown=24, NotChecked=0, Total=4970 [2024-11-09 06:06:17,360 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 24 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-09 06:06:43,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:06:46,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:06:48,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:06:51,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:06:53,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:06:55,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:06:58,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:00,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:03,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:05,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:08,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:11,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:16,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:18,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:22,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:24,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:27,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:30,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:33,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:36,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:39,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:41,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:43,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:48,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:52,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:07:55,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:13:42,891 WARN L286 SmtUtils]: Spent 4.88m on a formula simplification. DAG size of input: 266 DAG size of output: 265 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:13:44,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:13:45,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:13:47,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:13:49,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:13:53,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:13:54,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:13:55,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:13:56,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:13:58,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:13:59,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:14:01,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:14:03,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:14:04,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 06:14:07,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]