./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/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_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:31:48,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:31:48,916 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 05:31:48,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:31:48,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:31:48,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:31:48,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:31:48,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:31:48,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:31:48,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:31:48,948 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:31:48,948 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:31:48,949 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:31:48,949 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:31:48,950 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:31:48,950 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:31:48,951 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:31:48,951 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:31:48,952 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:31:48,952 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:31:48,952 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:31:48,953 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:31:48,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:31:48,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:31:48,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:31:48,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:31:48,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:31:48,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:31:48,956 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:31:48,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:31:48,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:31:48,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:31:48,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:31:48,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:31:48,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:31:48,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:31:48,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:31:48,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:31:48,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:31:48,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:31:48,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:31:48,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:31:48,962 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:31:48,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:31:48,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:31:48,963 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:31:48,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:31:48,964 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_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/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_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/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 ! call(reach_error())) ) 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 -> 3a59620f668b7c0725f940bc66e10441fbb56ee9b9fb687de4bd19a3f12eaeda [2024-11-09 05:31:49,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:31:49,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:31:49,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:31:49,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:31:49,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:31:49,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/list-simple/dll2n_append_equal.i Unable to find full path for "g++" [2024-11-09 05:31:51,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:31:51,638 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:31:51,639 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/sv-benchmarks/c/list-simple/dll2n_append_equal.i [2024-11-09 05:31:51,653 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/data/3f811377b/d224ad3843fa4d649ca8ff7936ef8cc9/FLAG2dccec430 [2024-11-09 05:31:51,973 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/data/3f811377b/d224ad3843fa4d649ca8ff7936ef8cc9 [2024-11-09 05:31:51,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:31:51,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:31:51,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:31:51,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:31:51,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:31:51,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:31:51" (1/1) ... [2024-11-09 05:31:51,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f247849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:51, skipping insertion in model container [2024-11-09 05:31:51,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:31:51" (1/1) ... [2024-11-09 05:31:52,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:31:52,441 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-11-09 05:31:52,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:31:52,460 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:31:52,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/sv-benchmarks/c/list-simple/dll2n_append_equal.i[24333,24346] [2024-11-09 05:31:52,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:31:52,571 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:31:52,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52 WrapperNode [2024-11-09 05:31:52,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:31:52,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:31:52,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:31:52,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:31:52,583 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:31:52" (1/1) ... [2024-11-09 05:31:52,597 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:31:52" (1/1) ... [2024-11-09 05:31:52,628 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2024-11-09 05:31:52,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:31:52,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:31:52,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:31:52,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:31:52,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52" (1/1) ... [2024-11-09 05:31:52,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52" (1/1) ... [2024-11-09 05:31:52,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52" (1/1) ... [2024-11-09 05:31:52,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52" (1/1) ... [2024-11-09 05:31:52,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52" (1/1) ... [2024-11-09 05:31:52,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52" (1/1) ... [2024-11-09 05:31:52,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52" (1/1) ... [2024-11-09 05:31:52,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52" (1/1) ... [2024-11-09 05:31:52,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:31:52,670 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:31:52,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:31:52,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:31:52,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52" (1/1) ... [2024-11-09 05:31:52,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:31:52,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:31:52,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/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:31:52,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/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:31:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:31:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:31:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-09 05:31:52,760 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-09 05:31:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 05:31:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:31:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:31:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 05:31:52,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 05:31:52,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:31:52,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 05:31:52,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:31:52,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:31:52,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:31:52,981 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:31:52,984 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:31:53,301 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-11-09 05:31:53,305 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:31:53,394 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:31:53,394 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 05:31:53,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:31:53 BoogieIcfgContainer [2024-11-09 05:31:53,395 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:31:53,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:31:53,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:31:53,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:31:53,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:31:51" (1/3) ... [2024-11-09 05:31:53,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50979b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:31:53, skipping insertion in model container [2024-11-09 05:31:53,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:31:52" (2/3) ... [2024-11-09 05:31:53,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50979b96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:31:53, skipping insertion in model container [2024-11-09 05:31:53,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:31:53" (3/3) ... [2024-11-09 05:31:53,412 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.i [2024-11-09 05:31:53,431 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:31:53,432 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:31:53,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:31:53,495 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=LoopHeads, 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;@7eabae1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:31:53,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:31:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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:31:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:31:53,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:31:53,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:31:53,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:31:53,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:31:53,516 INFO L85 PathProgramCache]: Analyzing trace with hash -301109969, now seen corresponding path program 1 times [2024-11-09 05:31:53,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:31:53,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535336061] [2024-11-09 05:31:53,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:31:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:53,878 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:31:53,879 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:31:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535336061] [2024-11-09 05:31:53,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535336061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:31:53,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:31:53,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 05:31:53,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582275083] [2024-11-09 05:31:53,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:31:53,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 05:31:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:31:53,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 05:31:53,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:31:53,924 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:31:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:31:54,006 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2024-11-09 05:31:54,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 05:31:54,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 05:31:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:31:54,017 INFO L225 Difference]: With dead ends: 55 [2024-11-09 05:31:54,017 INFO L226 Difference]: Without dead ends: 26 [2024-11-09 05:31:54,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 05:31:54,025 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:31:54,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 60 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:31:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-09 05:31:54,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-11-09 05:31:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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:31:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-09 05:31:54,070 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-09 05:31:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:31:54,071 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-09 05:31:54,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:31:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-09 05:31:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:31:54,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:31:54,073 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:31:54,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:31:54,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:31:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:31:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1159257916, now seen corresponding path program 1 times [2024-11-09 05:31:54,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:31:54,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163256252] [2024-11-09 05:31:54,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:54,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:31:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:54,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 05:31:54,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:31:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163256252] [2024-11-09 05:31:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163256252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:31:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114968990] [2024-11-09 05:31:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:31:54,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:31:54,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:31:54,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:31:54,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:31:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:31:54,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:31:54,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:31:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:31:54,584 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:31:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 05:31:54,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114968990] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:31:54,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1641300904] [2024-11-09 05:31:54,655 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-09 05:31:54,655 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:31:54,663 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:31:54,669 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:31:54,670 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:31:57,770 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 176 for LOIs [2024-11-09 05:31:58,128 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:32:22,386 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 227 DAG size of output: 226 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:32:34,544 WARN L286 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 235 DAG size of output: 234 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:32:34,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1641300904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:32:34,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:32:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4, 4, 4] total 17 [2024-11-09 05:32:34,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541156826] [2024-11-09 05:32:34,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:32:34,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 05:32:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:32:34,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 05:32:34,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=234, Unknown=1, NotChecked=0, Total=272 [2024-11-09 05:32:34,551 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 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:32:36,712 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 05:32:38,771 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 05:32:42,997 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 05:32:45,574 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 05:32:47,588 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 05:32:55,569 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 05:33:02,672 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 05:33:03,873 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] [2024-11-09 05:33:06,634 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 05:33:08,638 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 05:33:32,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:33:37,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:33:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:33:42,933 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-11-09 05:33:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:33:42,935 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 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 20 [2024-11-09 05:33:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:33:42,937 INFO L225 Difference]: With dead ends: 46 [2024-11-09 05:33:42,937 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 05:33:42,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=48, Invalid=293, Unknown=1, NotChecked=0, Total=342 [2024-11-09 05:33:42,939 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 4 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:33:42,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 318 Invalid, 9 Unknown, 0 Unchecked, 64.2s Time] [2024-11-09 05:33:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 05:33:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-09 05:33:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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:33:42,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-09 05:33:42,951 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 20 [2024-11-09 05:33:42,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:33:42,952 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-09 05:33:42,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 10 states have internal predecessors, (14), 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:33:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-09 05:33:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:33:42,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:33:42,953 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:33:42,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 05:33:43,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:33:43,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:33:43,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:33:43,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1576888275, now seen corresponding path program 1 times [2024-11-09 05:33:43,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:33:43,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630672591] [2024-11-09 05:33:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:33:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 05:33:43,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:33:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630672591] [2024-11-09 05:33:43,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630672591] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:33:43,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816691283] [2024-11-09 05:33:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:33:43,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:33:43,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:33:43,342 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:33:43,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:33:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:33:43,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 05:33:43,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:33:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:33:43,531 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:33:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 05:33:43,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816691283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:33:43,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1055287162] [2024-11-09 05:33:43,585 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2024-11-09 05:33:43,585 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:33:43,585 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:33:43,587 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:33:43,588 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:33:46,868 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 186 for LOIs [2024-11-09 05:33:47,145 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:33:55,093 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification. DAG size of input: 242 DAG size of output: 233 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:34:29,456 WARN L286 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 227 DAG size of output: 226 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:34:44,001 WARN L286 SmtUtils]: Spent 7.93s on a formula simplification. DAG size of input: 235 DAG size of output: 234 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:35:16,149 WARN L286 SmtUtils]: Spent 20.13s on a formula simplification. DAG size of input: 240 DAG size of output: 234 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:35:54,516 WARN L286 SmtUtils]: Spent 26.76s on a formula simplification. DAG size of input: 244 DAG size of output: 238 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:35:54,518 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '495#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_87| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~head#1.base_14| Int) (|v_#memory_$Pointer$.offset_87| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_dll_append_~head#1.base_14| (store (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0 0))) (or (and (= |v_ULTIMATE.start_dll_append_~head#1.base_14| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_34| (Array Int Int))) (= |#length| (store |v_#length_34| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) 12))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_31| Int) (|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_19| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_19| (Array Int (Array Int Int)))) (and (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (store |v_#memory_$Pointer$.offset_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_49|) (= |v_#memory_$Pointer$.base_49| (store |v_#memory_$Pointer$.base_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0)))) (= |v_#memory_int_53| (store |v_#memory_int_108| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_108| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_53| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (or (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_19| (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_19| |v_#memory_int_53|)) (and (= |v_old(#memory_int)_AFTER_CALL_19| (store |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_19| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_19| (store (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| (store (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_19| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)))))) (exists ((|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) (store (store (store (select |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_87| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.base_87|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= |v_#memory_int_39| (store |v_#memory_int_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) (store (select |v_#memory_int_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 4)))) (= |v_#memory_int_40| (store |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) (store (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 8 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 8)))) (= (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 0 1)) |v_#memory_int_109|))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#valid_40| (Array Int Int))) (and (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) 1) |#valid|) (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 0))) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_87| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.offset_87|))) (and (= |v_ULTIMATE.start_dll_append_~head#1.base_14| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_34| (Array Int Int))) (= |#length| (store |v_#length_34| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) 12))) (exists ((|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) (store (store (store (select |v_#memory_$Pointer$.base_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_87| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.base_87|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= |v_#memory_int_39| (store |v_#memory_int_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) (store (select |v_#memory_int_105| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 4 (select (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 4)))) (= |v_#memory_int_40| (store |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) (store (select |v_#memory_int_39| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 8 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 8)))) (= (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 0 1)) |v_#memory_int_109|))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.base_31| Int) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_86| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_86| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_49|) (= |v_#memory_int_53| (store |v_#memory_int_108| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_108| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_53| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= |v_#memory_$Pointer$.offset_49| (store |v_#memory_$Pointer$.offset_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_86| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0)))) (or (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_20| |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (store (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31| (store (select (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) 8 0))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|))) (and (= |v_old(#memory_int)_AFTER_CALL_20| |v_#memory_int_53|) (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_31|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#valid_40| (Array Int Int))) (and (= (store |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) 1) |#valid|) (= (select |v_#valid_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 0))) (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_83| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_87| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)) 0))) |v_#memory_$Pointer$.offset_87|)))) (= (select (select |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) 0) (= |#memory_int| (store |v_#memory_int_109| |v_ULTIMATE.start_dll_append_~head#1.base_14| (store (select |v_#memory_int_109| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_87| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0) 0) (= (store |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_dll_append_~head#1.base_14| (store (select |v_#memory_$Pointer$.base_87| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_14|) 0))) |#memory_$Pointer$.base|))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (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 05:35:54,518 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:35:54,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 05:35:54,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-09 05:35:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43759503] [2024-11-09 05:35:54,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 05:35:54,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:35:54,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:35:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=334, Unknown=4, NotChecked=0, Total=380 [2024-11-09 05:35:54,521 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:35:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:54,613 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-11-09 05:35:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 05:35:54,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2024-11-09 05:35:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:54,614 INFO L225 Difference]: With dead ends: 50 [2024-11-09 05:35:54,615 INFO L226 Difference]: Without dead ends: 30 [2024-11-09 05:35:54,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 127.4s TimeCoverageRelationStatistics Valid=42, Invalid=334, Unknown=4, NotChecked=0, Total=380 [2024-11-09 05:35:54,616 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:54,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 62 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:35:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-09 05:35:54,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-09 05:35:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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:35:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2024-11-09 05:35:54,630 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 21 [2024-11-09 05:35:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:54,630 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2024-11-09 05:35:54,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:35:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2024-11-09 05:35:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 05:35:54,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:54,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:54,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:35:54,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:54,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:35:54,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2062580960, now seen corresponding path program 2 times [2024-11-09 05:35:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:54,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725756016] [2024-11-09 05:35:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:54,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:35:55,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725756016] [2024-11-09 05:35:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725756016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861235143] [2024-11-09 05:35:55,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:35:55,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:55,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:35:55,758 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:35:55,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:35:55,882 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 05:35:55,883 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:35:55,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 05:35:55,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:56,308 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 05:35:56,689 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 05:35:56,697 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 05:35:56,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:56,717 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 20 treesize of output 15 [2024-11-09 05:35:56,855 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 28 treesize of output 16 [2024-11-09 05:35:56,862 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:35:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 05:35:57,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:35:57,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861235143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:35:57,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:35:57,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 22 [2024-11-09 05:35:57,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90543022] [2024-11-09 05:35:57,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:35:57,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:35:57,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:57,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:35:57,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2024-11-09 05:35:57,062 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 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 05:35:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:57,982 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-11-09 05:35:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:35:57,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 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 28 [2024-11-09 05:35:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:57,985 INFO L225 Difference]: With dead ends: 41 [2024-11-09 05:35:57,985 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 05:35:57,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2024-11-09 05:35:57,987 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:57,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 140 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:35:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 05:35:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2024-11-09 05:35:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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:35:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-09 05:35:58,005 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 28 [2024-11-09 05:35:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:58,005 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-09 05:35:58,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 10 states have internal predecessors, (17), 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 05:35:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-09 05:35:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:35:58,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:58,006 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:58,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:35:58,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:58,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:35:58,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:58,208 INFO L85 PathProgramCache]: Analyzing trace with hash -175657444, now seen corresponding path program 1 times [2024-11-09 05:35:58,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:58,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058318966] [2024-11-09 05:35:58,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:58,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:35:59,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:59,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058318966] [2024-11-09 05:35:59,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058318966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:59,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371811276] [2024-11-09 05:35:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:59,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:59,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:35:59,503 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:35:59,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:35:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:59,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 05:35:59,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:36:00,211 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 05:36:00,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:36:00,423 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 05:36:00,900 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2024-11-09 05:36:00,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2024-11-09 05:36:00,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:36:00,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 05:36:00,934 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 05:36:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:36:00,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:36:05,668 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_637 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (|v_node_create_~temp~0#1.base_36| Int) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_19| Int) (v_ArrVal_632 (Array Int Int)) (v_ArrVal_633 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_36| v_ArrVal_637))) (let ((.cse1 (select .cse0 |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse2 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select (store (store .cse0 |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse1 .cse2 v_ArrVal_633)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_19| v_ArrVal_632) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_36| 1)) (not (= (select .cse1 .cse2) 0)) (< |v_node_create_~temp~0#1.base_36| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_19|))))) is different from false [2024-11-09 05:36:05,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371811276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:36:05,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [357521482] [2024-11-09 05:36:05,675 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-09 05:36:05,675 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:36:05,675 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:36:05,675 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:36:05,675 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:36:07,313 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 186 for LOIs [2024-11-09 05:36:07,537 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:37:23,869 WARN L286 SmtUtils]: Spent 15.49s on a formula simplification. DAG size of input: 249 DAG size of output: 248 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:37:45,392 WARN L286 SmtUtils]: Spent 12.30s on a formula simplification. DAG size of input: 257 DAG size of output: 256 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:37:45,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [357521482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:37:45,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:37:45,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [16, 17] total 41 [2024-11-09 05:37:45,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473365625] [2024-11-09 05:37:45,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:37:45,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 05:37:45,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:37:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 05:37:45,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1831, Unknown=16, NotChecked=86, Total=2070 [2024-11-09 05:37:45,396 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 17 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 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 05:37:47,535 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 05:37:48,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:37:54,519 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 05:37:56,532 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 05:38:00,034 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 05:38:02,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:38:07,855 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 05:38:09,859 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 05:38:12,801 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 05:38:17,027 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 05:38:20,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:38:25,255 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 05:38:26,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:38:28,345 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 05:38:31,509 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 05:38:35,647 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 05:38:40,313 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 05:38:41,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:38:46,310 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 05:38:50,583 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 05:38:54,952 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 05:38:59,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:39:01,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:39:03,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:39:04,410 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 05:39:09,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:39:10,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:39:14,503 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 05:39:23,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:39:25,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:39:26,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:39:33,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:39:34,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:39:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:39:35,676 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-09 05:39:35,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 05:39:35,682 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 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 30 [2024-11-09 05:39:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:39:35,684 INFO L225 Difference]: With dead ends: 41 [2024-11-09 05:39:35,684 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 05:39:35,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 105.4s TimeCoverageRelationStatistics Valid=147, Invalid=2003, Unknown=16, NotChecked=90, Total=2256 [2024-11-09 05:39:35,686 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 3 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 102.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 108.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:39:35,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 62 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 376 Invalid, 16 Unknown, 0 Unchecked, 108.7s Time] [2024-11-09 05:39:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 05:39:35,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-09 05:39:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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:39:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-11-09 05:39:35,707 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 30 [2024-11-09 05:39:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:39:35,708 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-11-09 05:39:35,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 13 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 05:39:35,708 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-11-09 05:39:35,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:39:35,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:39:35,709 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:39:35,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 05:39:35,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:39:35,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:39:35,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:39:35,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2134546598, now seen corresponding path program 1 times [2024-11-09 05:39:35,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:39:35,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401225069] [2024-11-09 05:39:35,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:39:35,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:39:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 05:39:36,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:39:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401225069] [2024-11-09 05:39:36,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401225069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:39:36,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448248681] [2024-11-09 05:39:36,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:39:36,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:39:36,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:39:36,736 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:39:36,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:39:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:39:36,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 05:39:36,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:39:37,061 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 05:39:37,137 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_41| Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |v_node_create_~temp~0#1.base_41| (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_41|)) |c_#memory_$Pointer$.base|) (<= (+ |v_node_create_~temp~0#1.base_41| 1) |c_#StackHeapBarrier|))) is different from true [2024-11-09 05:39:37,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:37,153 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 05:39:37,169 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 05:39:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 1 not checked. [2024-11-09 05:39:37,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:39:37,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448248681] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:39:37,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1384669998] [2024-11-09 05:39:37,335 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 05:39:37,336 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:39:37,336 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:39:37,336 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:39:37,336 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:39:39,119 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 186 for LOIs [2024-11-09 05:39:39,306 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:40:12,886 WARN L286 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 227 DAG size of output: 226 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:40:14,659 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1230#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 05:40:14,659 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:40:14,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:40:14,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2024-11-09 05:40:14,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467953835] [2024-11-09 05:40:14,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:40:14,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 05:40:14,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:40:14,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 05:40:14,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=775, Unknown=6, NotChecked=56, Total=930 [2024-11-09 05:40:14,661 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 15 states, 10 states have (on average 2.4) internal successors, (24), 12 states have internal predecessors, (24), 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 05:40:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:40:15,297 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-09 05:40:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:40:15,298 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 2.4) internal successors, (24), 12 states have internal predecessors, (24), 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 30 [2024-11-09 05:40:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:40:15,299 INFO L225 Difference]: With dead ends: 43 [2024-11-09 05:40:15,299 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 05:40:15,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=118, Invalid=1002, Unknown=6, NotChecked=64, Total=1190 [2024-11-09 05:40:15,300 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:40:15,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 156 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 31 Unchecked, 0.4s Time] [2024-11-09 05:40:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 05:40:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 05:40:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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:40:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-09 05:40:15,317 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 30 [2024-11-09 05:40:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:40:15,318 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-09 05:40:15,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 2.4) internal successors, (24), 12 states have internal predecessors, (24), 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 05:40:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-09 05:40:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:40:15,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:40:15,319 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:40:15,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 05:40:15,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:40:15,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:40:15,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:40:15,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1150782221, now seen corresponding path program 1 times [2024-11-09 05:40:15,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:40:15,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110626917] [2024-11-09 05:40:15,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:40:15,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:40:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:40:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:40:18,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:40:18,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110626917] [2024-11-09 05:40:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110626917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:40:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320608907] [2024-11-09 05:40:18,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:40:18,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:40:18,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:40:18,895 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:40:18,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:40:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:40:19,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-11-09 05:40:19,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:40:19,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:40:20,818 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:40:20,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 05:40:21,158 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 13 treesize of output 1 [2024-11-09 05:40:21,169 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 13 treesize of output 1 [2024-11-09 05:40:21,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-09 05:40:21,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:40:22,033 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 38 treesize of output 22 [2024-11-09 05:40:22,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:40:22,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 05:40:22,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:40:22,331 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-09 05:40:22,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:40:22,595 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 46 treesize of output 35 [2024-11-09 05:40:22,656 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 05:40:22,656 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 20 treesize of output 23 [2024-11-09 05:40:22,730 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 05:40:22,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 05:40:22,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:40:22,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:40:23,925 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 89 [2024-11-09 05:40:24,005 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 05:40:24,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 137 [2024-11-09 05:40:24,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:40:24,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 56 [2024-11-09 05:40:24,047 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 26 treesize of output 15 [2024-11-09 05:40:24,073 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 34 treesize of output 19 [2024-11-09 05:40:24,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:40:24,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-11-09 05:40:24,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:40:24,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:40:24,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2024-11-09 05:40:24,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:40:24,406 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 83 treesize of output 42 [2024-11-09 05:40:24,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:40:24,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 05:40:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:40:24,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:40:24,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1035 Int) (v_ArrVal_1032 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= v_ArrVal_1032 (store (select |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 (select v_ArrVal_1032 .cse0)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1032))) (store .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_1035))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1030) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-09 05:40:25,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1035 Int) (v_ArrVal_1032 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (or (not (= (store (select |c_#memory_int| .cse0) .cse1 (select v_ArrVal_1032 .cse1)) v_ArrVal_1032)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse2 (store |c_#memory_int| .cse0 v_ArrVal_1032))) (store .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|) (+ |c_ULTIMATE.start_dll_append_~new_last~0#1.offset| 8) v_ArrVal_1035))) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1030) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2024-11-09 05:40:25,049 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1035 Int) (v_ArrVal_1032 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1032))) (store .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (+ 8 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|) v_ArrVal_1035))) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |c_ULTIMATE.start_dll_append_#t~ret7#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1030) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (store (select |c_#memory_int| .cse1) .cse2 (select v_ArrVal_1032 .cse2)) v_ArrVal_1032))))) is different from false [2024-11-09 05:40:25,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:40:25,396 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 166 [2024-11-09 05:40:25,472 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1035 Int) (v_ArrVal_1047 (Array Int Int)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| Int) (v_ArrVal_1032 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| v_ArrVal_1047)) (.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| v_ArrVal_1049))) (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| v_arrayElimArr_6)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32|) 0)) (not (= (select v_arrayElimArr_6 0) |c_ULTIMATE.start_dll_append_~data#1|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1032) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| (store (select (store .cse1 .cse0 v_ArrVal_1032) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32|) 8 v_ArrVal_1035)) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select .cse2 .cse0) .cse3 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| v_ArrVal_1029) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select .cse4 .cse0) .cse3 0)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| v_ArrVal_1030) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_32| 1)) (not (= (store (select .cse1 .cse0) .cse3 (select v_ArrVal_1032 .cse3)) v_ArrVal_1032)))))) is different from false [2024-11-09 05:40:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320608907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:40:25,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [401181708] [2024-11-09 05:40:25,480 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 05:40:25,480 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:40:25,480 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:40:25,480 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:40:25,481 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:40:28,174 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 186 for LOIs [2024-11-09 05:40:28,403 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:41:01,857 WARN L286 SmtUtils]: Spent 28.14s on a formula simplification. DAG size of input: 264 DAG size of output: 258 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:42:29,202 WARN L286 SmtUtils]: Spent 17.37s on a formula simplification. DAG size of input: 249 DAG size of output: 248 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:42:57,672 WARN L286 SmtUtils]: Spent 18.99s on a formula simplification. DAG size of input: 257 DAG size of output: 256 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:43:35,432 WARN L286 SmtUtils]: Spent 19.44s on a formula simplification. DAG size of input: 262 DAG size of output: 256 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:44:25,622 WARN L286 SmtUtils]: Spent 30.22s on a formula simplification. DAG size of input: 266 DAG size of output: 260 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:44:25,624 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1522#(and (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|) 1)) (or (not (= |ULTIMATE.start_main_~ptr~0#1.base| 0)) (not (= |ULTIMATE.start_main_~ptr~0#1.offset| 0))) (= |ULTIMATE.start_main_~count~0#1| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_22| Int) (|v_#memory_int_24| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| Int) (|v_#memory_$Pointer$.base_149| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int))) (|v_#memory_int_223| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_223| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_int_223| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 4) (select (select |v_#memory_int_24| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 4)))) |v_#memory_int_24|) (= (select (select |v_#memory_$Pointer$.offset_142| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 4)) 0) (or (and (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| 1) |#StackHeapBarrier|) (exists ((|v_#valid_65| (Array Int Int))) (and (= (store |v_#valid_65| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| 1) |#valid|) (= (select |v_#valid_65| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0))) (= |v_ULTIMATE.start_dll_append_~head#1.base_22| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| 0)) (exists ((|v_#memory_$Pointer$.offset_138| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_138| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (store (store (select |v_#memory_$Pointer$.offset_138| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0))) |v_#memory_$Pointer$.offset_142|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_219| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (select |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 8 (select (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 8))) |v_#memory_int_40|) (= |v_#memory_int_39| (store |v_#memory_int_219| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (select |v_#memory_int_219| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 4 (select (select |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 4)))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0 1)) |v_#memory_int_223|))) (exists ((|v_#length_55| (Array Int Int))) (= |#length| (store |v_#length_55| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| 12))) (exists ((|v_#memory_int_53| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_148| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_56| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_48| Int)) (and (= (store |v_#memory_$Pointer$.base_148| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_148| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_49|) (= (store |v_#memory_$Pointer$.offset_141| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_141| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_49|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (and (= |v_old(#memory_int)_AFTER_CALL_56| (store |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_48| (store (select |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_48|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_56| |v_ULTIMATE.start_dll_create_~head~0#1.base_48|) 8)))) (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_48|)) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| (store (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_48| (store (select (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_48|) 8 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| (store (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_48|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_48| (store (select (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_48|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_48|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0))))) (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_48|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_56| (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_56| |v_#memory_int_53|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))))) (= (store |v_#memory_int_222| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_222| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_53| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_56| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4))) |v_#memory_int_53|))) (exists ((|v_#memory_$Pointer$.base_145| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_145| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (store (store (select |v_#memory_$Pointer$.base_145| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0))) |v_#memory_$Pointer$.base_149|))) (and (<= (+ |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_53| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_55| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_55| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_148| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int))) (|v_#memory_int_222| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_49| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_55| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_48| Int)) (and (= (store |v_#memory_$Pointer$.base_148| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_148| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.base_49|) (= |v_#memory_int_53| (store |v_#memory_int_222| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (store (select |v_#memory_int_222| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 1) 4 (select (select |v_#memory_int_53| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (or (and (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_48|) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_55| (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0))) (= |v_old(#memory_int)_AFTER_CALL_55| |v_#memory_int_53|)) (and (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_48|)) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| (store (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_48|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_48| (store (select (store |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.base_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 |v_ULTIMATE.start_dll_create_~head~0#1.base_48|)) |v_ULTIMATE.start_dll_create_~head~0#1.base_48|) 8 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (= |v_old(#memory_int)_AFTER_CALL_55| (store |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_48| (store (select |v_#memory_int_53| |v_ULTIMATE.start_dll_create_~head~0#1.base_48|) 8 (select (select |v_old(#memory_int)_AFTER_CALL_55| |v_ULTIMATE.start_dll_create_~head~0#1.base_48|) 8)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_55| (store (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_48| (store (select (store |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 4 0)) |v_ULTIMATE.start_dll_create_~head~0#1.base_48|) 8 0))))) (= (store |v_#memory_$Pointer$.offset_141| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0) (store (select |v_#memory_$Pointer$.offset_141| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0 (select (select |v_#memory_$Pointer$.offset_49| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_55| |ULTIMATE.start_main_~#s~0#1.base|) 0)) 0))) |v_#memory_$Pointer$.offset_49|))) (exists ((|v_#valid_65| (Array Int Int))) (and (= (store |v_#valid_65| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| 1) |#valid|) (= (select |v_#valid_65| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0))) (= |v_ULTIMATE.start_dll_append_~head#1.base_22| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| 0)) (exists ((|v_#memory_$Pointer$.offset_138| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_138| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (store (store (select |v_#memory_$Pointer$.offset_138| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0))) |v_#memory_$Pointer$.offset_142|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_219| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (select |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 8 (select (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 8))) |v_#memory_int_40|) (= |v_#memory_int_39| (store |v_#memory_int_219| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (select |v_#memory_int_219| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 4 (select (select |v_#memory_int_39| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 4)))) (= (store |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (select |v_#memory_int_40| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0 1)) |v_#memory_int_223|))) (exists ((|v_#length_55| (Array Int Int))) (= |#length| (store |v_#length_55| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| 12))) (exists ((|v_#memory_$Pointer$.base_145| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_145| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (store (store (select |v_#memory_$Pointer$.base_145| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 0))) |v_#memory_$Pointer$.base_149|)))) (= 0 (select (select |v_#memory_$Pointer$.base_149| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 4))) (= (store (store |v_#memory_$Pointer$.base_149| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_$Pointer$.base_149| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (select (store |v_#memory_$Pointer$.base_149| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_$Pointer$.base_149| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 8 (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 8))) |#memory_int|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_142| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_$Pointer$.offset_142| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27| (store (select (store |v_#memory_$Pointer$.offset_142| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_$Pointer$.offset_142| (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) (+ (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_27|) 8 (select (select |v_#memory_$Pointer$.offset_142| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)))))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (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 05:44:25,624 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:44:25,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:44:25,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 40 [2024-11-09 05:44:25,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683173078] [2024-11-09 05:44:25,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:44:25,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 05:44:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:44:25,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 05:44:25,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3132, Unknown=15, NotChecked=460, Total=3782 [2024-11-09 05:44:25,627 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 40 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 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 05:44:29,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:44:29,601 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2024-11-09 05:44:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 05:44:29,602 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 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 31 [2024-11-09 05:44:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:44:29,603 INFO L225 Difference]: With dead ends: 45 [2024-11-09 05:44:29,603 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 05:44:29,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 244.1s TimeCoverageRelationStatistics Valid=249, Invalid=4173, Unknown=16, NotChecked=532, Total=4970 [2024-11-09 05:44:29,605 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 34 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:44:29,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 406 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 05:44:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 05:44:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2024-11-09 05:44:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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:44:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-09 05:44:29,622 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 31 [2024-11-09 05:44:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:44:29,623 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-09 05:44:29,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 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 05:44:29,623 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-09 05:44:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 05:44:29,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:44:29,624 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:44:29,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 05:44:29,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:44:29,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:44:29,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:44:29,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1756294697, now seen corresponding path program 1 times [2024-11-09 05:44:29,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:44:29,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201984837] [2024-11-09 05:44:29,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:44:29,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:44:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:44:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 05:44:31,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:44:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201984837] [2024-11-09 05:44:31,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201984837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:44:31,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568818378] [2024-11-09 05:44:31,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:44:31,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:44:31,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:44:31,439 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:44:31,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:44:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:44:31,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 05:44:31,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:44:31,839 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 05:44:32,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:44:32,014 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 05:44:32,497 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2024-11-09 05:44:32,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2024-11-09 05:44:32,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:44:32,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 17 treesize of output 12 [2024-11-09 05:44:32,530 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 05:44:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 05:44:32,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:44:39,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_37| Int) (v_ArrVal_1248 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|ULTIMATE.start_dll_append_~last~0#1.base| Int) (v_ArrVal_1245 Int) (v_ArrVal_1243 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_37| v_ArrVal_1248) |ULTIMATE.start_dll_append_~last~0#1.base|)) (.cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_1245)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_37| v_ArrVal_1243) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= (select .cse0 .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_37| 1))))) is different from false [2024-11-09 05:44:39,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568818378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:44:39,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [335583881] [2024-11-09 05:44:39,308 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2024-11-09 05:44:39,308 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:44:39,308 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:44:39,308 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:44:39,308 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:44:45,034 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 186 for LOIs [2024-11-09 05:44:45,291 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:45:14,265 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1821#(and (<= 1 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_31| Int) (|v_#memory_int_24| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_168| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_157| (Array Int (Array Int Int))) (|v_#memory_int_252| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_24| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_157| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) (store (select |v_#memory_$Pointer$.offset_157| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31| (store (select (store |v_#memory_$Pointer$.offset_157| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) (store (select |v_#memory_$Pointer$.offset_157| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) (store (select |v_#memory_$Pointer$.base_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31| (store (select (store |v_#memory_$Pointer$.base_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) (store (select |v_#memory_$Pointer$.base_168| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)))) (= |v_#memory_int_24| (store |v_#memory_int_252| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) (store (select |v_#memory_int_252| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4) (select (select |v_#memory_int_24| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_31|) 8) 4))))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 05:45:14,265 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:45:14,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:45:14,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2024-11-09 05:45:14,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152875044] [2024-11-09 05:45:14,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:45:14,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 05:45:14,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:45:14,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 05:45:14,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1753, Unknown=7, NotChecked=84, Total=1980 [2024-11-09 05:45:14,267 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 24 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:45:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:45:16,202 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-09 05:45:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 05:45:16,203 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2024-11-09 05:45:16,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:45:16,207 INFO L225 Difference]: With dead ends: 42 [2024-11-09 05:45:16,207 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 05:45:16,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=208, Invalid=2441, Unknown=7, NotChecked=100, Total=2756 [2024-11-09 05:45:16,209 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 46 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:45:16,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 206 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 05:45:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 05:45:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-09 05:45:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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:45:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-09 05:45:16,235 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 32 [2024-11-09 05:45:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:45:16,236 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-09 05:45:16,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:45:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-09 05:45:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 05:45:16,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:45:16,240 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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 05:45:16,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 05:45:16,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:45:16,444 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:45:16,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:45:16,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2095077715, now seen corresponding path program 1 times [2024-11-09 05:45:16,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:45:16,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097509132] [2024-11-09 05:45:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:45:16,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:45:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:45:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:45:18,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:45:18,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097509132] [2024-11-09 05:45:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097509132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:45:18,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331093791] [2024-11-09 05:45:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:45:18,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:45:18,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:45:18,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:45:18,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07f9a792-6bbe-4f71-b30d-e4c8f4aa4821/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:45:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:45:18,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-09 05:45:18,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:45:18,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 05:45:19,287 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 05:45:19,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 05:45:19,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 05:45:19,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2024-11-09 05:45:19,504 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 05:45:19,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2024-11-09 05:45:19,957 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 05:45:19,957 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 68 treesize of output 31 [2024-11-09 05:45:19,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 05:45:19,974 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:45:20,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:45:20,301 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:45:20,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:45:20,362 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 05:45:20,362 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 76 treesize of output 57 [2024-11-09 05:45:20,439 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-09 05:45:20,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 30 [2024-11-09 05:45:21,575 INFO L349 Elim1Store]: treesize reduction 70, result has 33.3 percent of original size [2024-11-09 05:45:21,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 83 [2024-11-09 05:45:21,633 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 05:45:21,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-11-09 05:45:21,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:45:21,730 INFO L349 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2024-11-09 05:45:21,731 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 5 case distinctions, treesize of input 96 treesize of output 82 [2024-11-09 05:45:21,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:45:21,815 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-09 05:45:21,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-09 05:45:21,831 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 7 treesize of output 3 [2024-11-09 05:45:21,859 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 7 treesize of output 3 [2024-11-09 05:45:23,298 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:45:23,565 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 05:45:23,565 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 57 treesize of output 24 [2024-11-09 05:45:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:45:23,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:45:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331093791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:45:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [653773050] [2024-11-09 05:45:27,444 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-09 05:45:27,445 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:45:27,445 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:45:27,445 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:45:27,445 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:45:28,909 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 186 for LOIs [2024-11-09 05:45:29,104 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:46:58,806 WARN L286 SmtUtils]: Spent 15.66s on a formula simplification. DAG size of input: 249 DAG size of output: 248 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:47:00,651 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2132#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2024-11-09 05:47:00,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:47:00,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:47:00,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 33 [2024-11-09 05:47:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261893173] [2024-11-09 05:47:00,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:47:00,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 05:47:00,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:47:00,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 05:47:00,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=3085, Unknown=24, NotChecked=0, Total=3306 [2024-11-09 05:47:00,653 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 33 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5)