./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91 --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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:04:45,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:04:45,866 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:04:45,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:04:45,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:04:45,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:04:45,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:04:45,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:04:45,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:04:45,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:04:45,902 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:04:45,903 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:04:45,904 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:04:45,904 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:04:45,905 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:04:45,905 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:04:45,906 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:04:45,906 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:04:45,907 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:04:45,907 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:04:45,908 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:04:45,909 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:04:45,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:04:45,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:04:45,911 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:04:45,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:04:45,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:04:45,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:04:45,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:04:45,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:04:45,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:04:45,914 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:04:45,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:04:45,915 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:04:45,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:04:45,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:04:45,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:04:45,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:04:45,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:04:45,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:04:45,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:04:45,919 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:04:45,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:04:45,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:04:45,920 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:04:45,921 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:04:45,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:04:45,921 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_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/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_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2023-11-25 00:04:46,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:04:46,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:04:46,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:04:46,239 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:04:46,239 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:04:46,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-11-25 00:04:49,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:04:49,690 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:04:49,702 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-11-25 00:04:49,726 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/data/dec89d98b/4391a467fd1440c8af48054294c9e422/FLAG949a06519 [2023-11-25 00:04:49,739 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/data/dec89d98b/4391a467fd1440c8af48054294c9e422 [2023-11-25 00:04:49,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:04:49,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:04:49,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:04:49,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:04:49,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:04:49,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:04:49" (1/1) ... [2023-11-25 00:04:49,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5410b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:49, skipping insertion in model container [2023-11-25 00:04:49,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:04:49" (1/1) ... [2023-11-25 00:04:49,795 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:04:50,192 WARN L240 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_48d720c2-09d6-4c44-bea1-d8116f00e834/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2023-11-25 00:04:50,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:04:50,214 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:04:50,289 WARN L240 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_48d720c2-09d6-4c44-bea1-d8116f00e834/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2023-11-25 00:04:50,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:04:50,335 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:04:50,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50 WrapperNode [2023-11-25 00:04:50,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:04:50,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:04:50,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:04:50,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:04:50,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,414 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 161 [2023-11-25 00:04:50,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:04:50,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:04:50,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:04:50,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:04:50,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:04:50,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:04:50,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:04:50,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:04:50,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (1/1) ... [2023-11-25 00:04:50,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:04:50,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:04:50,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:04:50,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:04:50,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:04:50,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:04:50,586 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-25 00:04:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-25 00:04:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:04:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:04:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:04:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-25 00:04:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-25 00:04:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:04:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-25 00:04:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:04:50,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:04:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:04:50,772 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:04:50,775 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:04:51,081 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:04:51,136 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:04:51,141 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-25 00:04:51,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:04:51 BoogieIcfgContainer [2023-11-25 00:04:51,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:04:51,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:04:51,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:04:51,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:04:51,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:04:49" (1/3) ... [2023-11-25 00:04:51,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438af93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:04:51, skipping insertion in model container [2023-11-25 00:04:51,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:50" (2/3) ... [2023-11-25 00:04:51,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438af93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:04:51, skipping insertion in model container [2023-11-25 00:04:51,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:04:51" (3/3) ... [2023-11-25 00:04:51,159 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2023-11-25 00:04:51,179 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:04:51,180 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:04:51,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:04:51,231 INFO L357 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, mHoare=true, 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;@7ff9e12d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:04:51,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:04:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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) [2023-11-25 00:04:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-25 00:04:51,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:51,244 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:51,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:04:51,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:51,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1771523034, now seen corresponding path program 1 times [2023-11-25 00:04:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:51,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907124183] [2023-11-25 00:04:51,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:51,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:04:51,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907124183] [2023-11-25 00:04:51,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907124183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:51,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:51,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:04:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268631106] [2023-11-25 00:04:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:51,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-25 00:04:51,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:51,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-25 00:04:51,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-25 00:04:51,633 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:04:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:51,667 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2023-11-25 00:04:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-25 00:04:51,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-11-25 00:04:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:51,676 INFO L225 Difference]: With dead ends: 49 [2023-11-25 00:04:51,676 INFO L226 Difference]: Without dead ends: 26 [2023-11-25 00:04:51,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-25 00:04:51,683 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:51,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:04:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-25 00:04:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-25 00:04:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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) [2023-11-25 00:04:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2023-11-25 00:04:51,720 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 18 [2023-11-25 00:04:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:51,722 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2023-11-25 00:04:51,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:04:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2023-11-25 00:04:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-25 00:04:51,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:51,724 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:51,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:04:51,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:04:51,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:51,725 INFO L85 PathProgramCache]: Analyzing trace with hash -924067909, now seen corresponding path program 1 times [2023-11-25 00:04:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:51,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198175289] [2023-11-25 00:04:51,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:04:52,067 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:52,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198175289] [2023-11-25 00:04:52,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198175289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:52,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:52,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:04:52,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808694948] [2023-11-25 00:04:52,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:52,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:52,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:52,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:52,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:52,074 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-25 00:04:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:52,118 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2023-11-25 00:04:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2023-11-25 00:04:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:52,124 INFO L225 Difference]: With dead ends: 47 [2023-11-25 00:04:52,124 INFO L226 Difference]: Without dead ends: 27 [2023-11-25 00:04:52,125 INFO L412 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 [2023-11-25 00:04:52,126 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:52,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:04:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-25 00:04:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-25 00:04:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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) [2023-11-25 00:04:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2023-11-25 00:04:52,133 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 19 [2023-11-25 00:04:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:52,134 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2023-11-25 00:04:52,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-25 00:04:52,134 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2023-11-25 00:04:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-25 00:04:52,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:52,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:52,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:04:52,136 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:04:52,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash -750855739, now seen corresponding path program 1 times [2023-11-25 00:04:52,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:52,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980067850] [2023-11-25 00:04:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:52,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:04:52,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:52,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980067850] [2023-11-25 00:04:52,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980067850] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:04:52,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522709390] [2023-11-25 00:04:52,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:52,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:04:52,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:04:52,990 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:04:53,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:04:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:53,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-25 00:04:53,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:53,498 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 [2023-11-25 00:04:53,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:04:53,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-25 00:04:53,633 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 [2023-11-25 00:04:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:04:53,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:04:53,748 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| Int)) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_216) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| 1)))) is different from false [2023-11-25 00:04:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522709390] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:04:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1164506243] [2023-11-25 00:04:53,779 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-25 00:04:53,779 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:04:53,784 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:04:53,790 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:04:53,791 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:04:56,415 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-25 00:04:56,438 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:05:20,047 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '353#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~last~2#1.offset|) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |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_sll_circular_append_~head#1.base_14| Int) (|v_#memory_$Pointer$.base_60| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int))) (|v_#memory_int_16| (Array Int (Array Int Int))) (|v_#memory_int_71| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8| Int)) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0)) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 0))) (= |v_#memory_int_16| (store |v_#memory_int_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_71| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_16| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0)))) (or (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8|) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.offset_57|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 8))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) (exists ((|v_#valid_33| (Array Int Int))) (and (= |#valid| (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1)) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.base_60|)) (exists ((|v_old(#memory_int)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_int_70| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_13| (store |v_#memory_int_70| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_70| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_13| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|))) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4 5)) |v_#memory_int_71|) (= |v_#memory_int_40| (store |v_#memory_int_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))))))) (and (= |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8|) (exists ((|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.offset_53| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.offset_57| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.offset_57|)) (<= (+ (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1) |#StackHeapBarrier|) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 8))) (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0)) (exists ((|v_#valid_33| (Array Int Int))) (and (= |#valid| (store |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 1)) (= (select |v_#valid_33| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0))) (= |v_ULTIMATE.start_sll_circular_append_#in~head#1.base_8| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 0) 4 (select (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4))) |v_#memory_$Pointer$.base_60|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 4 5)) |v_#memory_int_71|) (= |v_#memory_int_40| (store |v_#memory_int_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_int_67| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |v_#memory_int_40| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0)))))) (exists ((|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| Int) (|v_#memory_int_70| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_12| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_59| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.offset_56| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_$Pointer$.base_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |v_old(#memory_int)_AFTER_CALL_12| (store |v_#memory_int_70| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15| (store (select |v_#memory_int_70| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_12| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_15|) 0)))))))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select (store |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) (store (select |v_#memory_$Pointer$.base_60| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0))) |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (= |#memory_int| (store |v_#memory_int_16| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14| (store (select |v_#memory_int_16| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (= (select (select |v_#memory_$Pointer$.offset_57| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0) 0) (= 0 (select (select |v_#memory_$Pointer$.base_60| |v_ULTIMATE.start_sll_circular_append_~head#1.base_14|) 0)))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |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 [2023-11-25 00:05:20,047 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:05:20,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:05:20,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2023-11-25 00:05:20,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288972275] [2023-11-25 00:05:20,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:05:20,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-25 00:05:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:05:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-25 00:05:20,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1286, Unknown=14, NotChecked=72, Total=1482 [2023-11-25 00:05:20,057 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:05:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:05:20,791 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2023-11-25 00:05:20,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-25 00:05:20,794 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2023-11-25 00:05:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:05:20,795 INFO L225 Difference]: With dead ends: 40 [2023-11-25 00:05:20,795 INFO L226 Difference]: Without dead ends: 29 [2023-11-25 00:05:20,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=159, Invalid=1722, Unknown=15, NotChecked=84, Total=1980 [2023-11-25 00:05:20,798 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:05:20,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 217 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:05:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-25 00:05:20,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-11-25 00:05:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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) [2023-11-25 00:05:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2023-11-25 00:05:20,806 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 25 [2023-11-25 00:05:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:05:20,806 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2023-11-25 00:05:20,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:05:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2023-11-25 00:05:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-25 00:05:20,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:05:20,808 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:05:20,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-25 00:05:21,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:05:21,014 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:05:21,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:05:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash -183914670, now seen corresponding path program 1 times [2023-11-25 00:05:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:05:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160890069] [2023-11-25 00:05:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:21,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:05:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:05:22,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:05:22,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160890069] [2023-11-25 00:05:22,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160890069] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:05:22,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439487619] [2023-11-25 00:05:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:22,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:05:22,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:05:22,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:05:22,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48d720c2-09d6-4c44-bea1-d8116f00e834/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:05:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:22,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-25 00:05:22,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:05:22,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:05:22,843 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-25 00:05:22,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-25 00:05:22,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:05:23,065 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-25 00:05:23,065 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 54 treesize of output 41 [2023-11-25 00:05:23,186 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:05:23,187 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 48 treesize of output 23 [2023-11-25 00:05:23,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:05:23,202 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 [2023-11-25 00:05:23,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:05:23,409 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-25 00:05:23,410 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 56 treesize of output 45 [2023-11-25 00:05:23,437 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-25 00:05:23,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-25 00:05:23,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:05:23,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:05:23,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:05:23,902 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 24 treesize of output 26 [2023-11-25 00:05:23,949 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-25 00:05:23,949 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 69 treesize of output 57 [2023-11-25 00:05:23,994 INFO L349 Elim1Store]: treesize reduction 74, result has 21.3 percent of original size [2023-11-25 00:05:23,997 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 6 case distinctions, treesize of input 105 treesize of output 101 [2023-11-25 00:05:24,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:05:24,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2023-11-25 00:05:24,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-11-25 00:05:24,183 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 [2023-11-25 00:05:24,257 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:05:24,258 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 44 treesize of output 19 [2023-11-25 00:05:24,261 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:05:24,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:05:24,287 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_351 (Array Int Int)) (v_ArrVal_352 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_351))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-11-25 00:05:24,326 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_351 (Array Int Int)) (v_ArrVal_352 (Array Int Int))) (or (not (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) .cse2 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_351))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) .cse2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (< (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|))) is different from false [2023-11-25 00:05:25,547 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| Int) (v_ArrVal_358 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_351 (Array Int Int)) (v_ArrVal_352 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_358))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19|) 0)) (not (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_357))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select .cse4 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) .cse3 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_351))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16| (store (select .cse2 |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) .cse3 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| v_ArrVal_352) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) (< (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.base_16|) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_19| 1))))) is different from false [2023-11-25 00:05:25,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439487619] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:05:25,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1992489284] [2023-11-25 00:05:25,553 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-25 00:05:25,553 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:05:25,553 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:05:25,554 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:05:25,554 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:05:27,585 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-25 00:05:27,597 INFO L180 IcfgInterpreter]: Interpretation finished