./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/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_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:06:04,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:06:04,684 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-25 00:06:04,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:06:04,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:06:04,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:06:04,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:06:04,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:06:04,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:06:04,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:06:04,720 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:06:04,721 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:06:04,721 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:06:04,724 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:06:04,724 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:06:04,725 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:06:04,726 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:06:04,727 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:06:04,731 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:06:04,731 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:06:04,732 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:06:04,732 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:06:04,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-25 00:06:04,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-25 00:06:04,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:06:04,734 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:06:04,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:06:04,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:06:04,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:06:04,736 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-25 00:06:04,736 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-25 00:06:04,736 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-25 00:06:04,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:06:04,737 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-25 00:06:04,738 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-25 00:06:04,738 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:06:04,738 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:06:04,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:06:04,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:06:04,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:06:04,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:06:04,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:06:04,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:06:04,742 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:06:04,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:06:04,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:06:04,743 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:06:04,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:06:04,744 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_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/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_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2023-11-25 00:06:05,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:06:05,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:06:05,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:06:05,053 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:06:05,054 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:06:05,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-25 00:06:08,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:06:08,549 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:06:08,549 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2023-11-25 00:06:08,562 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/data/a076dc15d/44c6441b63c2445da68a3b11166e3cd0/FLAG2d738fe92 [2023-11-25 00:06:08,576 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/data/a076dc15d/44c6441b63c2445da68a3b11166e3cd0 [2023-11-25 00:06:08,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:06:08,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:06:08,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:06:08,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:06:08,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:06:08,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:06:08" (1/1) ... [2023-11-25 00:06:08,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a976a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:08, skipping insertion in model container [2023-11-25 00:06:08,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:06:08" (1/1) ... [2023-11-25 00:06:08,640 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:06:08,957 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:06:08,970 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:06:09,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:06:09,096 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:06:09,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09 WrapperNode [2023-11-25 00:06:09,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:06:09,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:06:09,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:06:09,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:06:09,107 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:06:09" (1/1) ... [2023-11-25 00:06:09,144 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:06:09" (1/1) ... [2023-11-25 00:06:09,186 INFO L138 Inliner]: procedures = 127, calls = 44, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2023-11-25 00:06:09,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:06:09,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:06:09,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:06:09,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:06:09,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09" (1/1) ... [2023-11-25 00:06:09,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09" (1/1) ... [2023-11-25 00:06:09,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09" (1/1) ... [2023-11-25 00:06:09,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09" (1/1) ... [2023-11-25 00:06:09,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09" (1/1) ... [2023-11-25 00:06:09,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09" (1/1) ... [2023-11-25 00:06:09,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09" (1/1) ... [2023-11-25 00:06:09,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09" (1/1) ... [2023-11-25 00:06:09,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:06:09,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:06:09,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:06:09,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:06:09,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09" (1/1) ... [2023-11-25 00:06:09,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:06:09,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:09,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/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:06:09,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/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:06:09,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:06:09,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:06:09,330 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-25 00:06:09,330 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-25 00:06:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:06:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:06:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:06:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-25 00:06:09,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-25 00:06:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:06:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-25 00:06:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:06:09,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:06:09,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:06:09,470 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:06:09,473 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:06:09,924 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:06:10,022 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:06:10,023 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-25 00:06:10,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:06:10 BoogieIcfgContainer [2023-11-25 00:06:10,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:06:10,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:06:10,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:06:10,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:06:10,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:06:08" (1/3) ... [2023-11-25 00:06:10,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7095805b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:06:10, skipping insertion in model container [2023-11-25 00:06:10,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:06:09" (2/3) ... [2023-11-25 00:06:10,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7095805b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:06:10, skipping insertion in model container [2023-11-25 00:06:10,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:06:10" (3/3) ... [2023-11-25 00:06:10,036 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2023-11-25 00:06:10,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:06:10,055 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-11-25 00:06:10,101 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:06:10,107 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7efdc394, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:06:10,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-11-25 00:06:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 50 states have (on average 2.28) internal successors, (114), 102 states have internal predecessors, (114), 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:06:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-25 00:06:10,126 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:10,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-25 00:06:10,127 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:10,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash 233264712, now seen corresponding path program 1 times [2023-11-25 00:06:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:10,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609317630] [2023-11-25 00:06:10,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:06:10,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609317630] [2023-11-25 00:06:10,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609317630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:10,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:06:10,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:06:10,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460068041] [2023-11-25 00:06:10,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:10,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:06:10,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:06:10,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:06:10,537 INFO L87 Difference]: Start difference. First operand has 107 states, 50 states have (on average 2.28) internal successors, (114), 102 states have internal predecessors, (114), 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 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:06:10,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:10,750 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2023-11-25 00:06:10,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:06:10,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-25 00:06:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:10,763 INFO L225 Difference]: With dead ends: 104 [2023-11-25 00:06:10,763 INFO L226 Difference]: Without dead ends: 102 [2023-11-25 00:06:10,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:06:10,769 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:10,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 144 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:06:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-25 00:06:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-25 00:06:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 97 states have internal predecessors, (104), 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:06:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2023-11-25 00:06:10,823 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 5 [2023-11-25 00:06:10,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:10,824 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2023-11-25 00:06:10,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:06:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2023-11-25 00:06:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-25 00:06:10,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:10,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-25 00:06:10,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:06:10,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:10,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash 233264713, now seen corresponding path program 1 times [2023-11-25 00:06:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009455507] [2023-11-25 00:06:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:06:10,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:10,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009455507] [2023-11-25 00:06:10,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009455507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:10,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:06:10,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:06:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640000163] [2023-11-25 00:06:10,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:10,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:06:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:11,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:06:11,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:06:11,000 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:06:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:11,129 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-25 00:06:11,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:06:11,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-25 00:06:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:11,135 INFO L225 Difference]: With dead ends: 100 [2023-11-25 00:06:11,135 INFO L226 Difference]: Without dead ends: 100 [2023-11-25 00:06:11,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:06:11,144 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:11,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 149 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:06:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-25 00:06:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-25 00:06:11,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 48 states have (on average 2.125) internal successors, (102), 95 states have internal predecessors, (102), 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:06:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-11-25 00:06:11,166 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 5 [2023-11-25 00:06:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:11,167 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-11-25 00:06:11,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:06:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-11-25 00:06:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-25 00:06:11,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:11,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:11,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:06:11,169 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:11,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash -791725780, now seen corresponding path program 1 times [2023-11-25 00:06:11,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:11,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722473857] [2023-11-25 00:06:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:06:11,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:11,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722473857] [2023-11-25 00:06:11,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722473857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:11,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:06:11,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:06:11,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634685856] [2023-11-25 00:06:11,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:11,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:06:11,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:11,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:06:11,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:06:11,296 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-11-25 00:06:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:11,345 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2023-11-25 00:06:11,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:06:11,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 10 [2023-11-25 00:06:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:11,350 INFO L225 Difference]: With dead ends: 101 [2023-11-25 00:06:11,351 INFO L226 Difference]: Without dead ends: 101 [2023-11-25 00:06:11,351 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:06:11,353 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:11,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 178 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:06:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-25 00:06:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-25 00:06:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 96 states have internal predecessors, (103), 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:06:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2023-11-25 00:06:11,373 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 10 [2023-11-25 00:06:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:11,375 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2023-11-25 00:06:11,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-11-25 00:06:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2023-11-25 00:06:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-25 00:06:11,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:11,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:11,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-25 00:06:11,378 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:11,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash 434569947, now seen corresponding path program 1 times [2023-11-25 00:06:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:11,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164834588] [2023-11-25 00:06:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:11,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:06:11,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:11,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164834588] [2023-11-25 00:06:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164834588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:11,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:06:11,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:06:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971055763] [2023-11-25 00:06:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:11,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:06:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:11,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:06:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:06:11,625 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:06:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:11,924 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2023-11-25 00:06:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:06:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-25 00:06:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:11,928 INFO L225 Difference]: With dead ends: 100 [2023-11-25 00:06:11,929 INFO L226 Difference]: Without dead ends: 100 [2023-11-25 00:06:11,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:06:11,931 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:11,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 288 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:06:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-25 00:06:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-25 00:06:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 95 states have internal predecessors, (102), 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:06:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-11-25 00:06:11,942 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 17 [2023-11-25 00:06:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:11,942 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-11-25 00:06:11,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:06:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-11-25 00:06:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-25 00:06:11,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:11,944 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:11,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-25 00:06:11,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:11,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash 434569948, now seen corresponding path program 1 times [2023-11-25 00:06:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880192671] [2023-11-25 00:06:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:06:12,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880192671] [2023-11-25 00:06:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880192671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:06:12,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:06:12,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178405467] [2023-11-25 00:06:12,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:12,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:06:12,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:12,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:06:12,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:06:12,251 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:06:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:12,439 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-11-25 00:06:12,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:06:12,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-25 00:06:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:12,442 INFO L225 Difference]: With dead ends: 99 [2023-11-25 00:06:12,442 INFO L226 Difference]: Without dead ends: 99 [2023-11-25 00:06:12,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:06:12,443 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:12,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 343 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:06:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-25 00:06:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-25 00:06:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 49 states have (on average 2.061224489795918) internal successors, (101), 94 states have internal predecessors, (101), 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:06:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-11-25 00:06:12,463 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 17 [2023-11-25 00:06:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:12,463 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-11-25 00:06:12,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:06:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-11-25 00:06:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-25 00:06:12,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:12,465 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:12,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-25 00:06:12,466 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:12,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:12,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1010090430, now seen corresponding path program 1 times [2023-11-25 00:06:12,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:12,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077170123] [2023-11-25 00:06:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:06:12,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:12,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077170123] [2023-11-25 00:06:12,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077170123] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:12,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888484133] [2023-11-25 00:06:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:12,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:12,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:12,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:06:12,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:06:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:12,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-25 00:06:12,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:13,013 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:06:13,118 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-25 00:06:13,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-25 00:06:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:06:13,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:06:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:06:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888484133] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:06:13,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [921326275] [2023-11-25 00:06:13,555 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-25 00:06:13,556 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:06:13,560 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:06:13,565 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:06:13,566 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:06:15,216 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-25 00:06:15,337 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:06:17,849 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1267#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-25 00:06:17,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:06:17,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:06:17,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2023-11-25 00:06:17,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152805908] [2023-11-25 00:06:17,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:06:17,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-25 00:06:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:17,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-25 00:06:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=747, Unknown=2, NotChecked=0, Total=870 [2023-11-25 00:06:17,852 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-25 00:06:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:18,287 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-11-25 00:06:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:06:18,288 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2023-11-25 00:06:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:18,289 INFO L225 Difference]: With dead ends: 98 [2023-11-25 00:06:18,289 INFO L226 Difference]: Without dead ends: 98 [2023-11-25 00:06:18,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=133, Invalid=795, Unknown=2, NotChecked=0, Total=930 [2023-11-25 00:06:18,291 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:18,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 550 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-25 00:06:18,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-25 00:06:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-25 00:06:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 93 states have internal predecessors, (100), 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:06:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-11-25 00:06:18,298 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 19 [2023-11-25 00:06:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:18,299 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-11-25 00:06:18,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-25 00:06:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-11-25 00:06:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-25 00:06:18,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:18,300 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:18,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-25 00:06:18,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-25 00:06:18,511 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:18,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:18,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1010090431, now seen corresponding path program 1 times [2023-11-25 00:06:18,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:18,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291313395] [2023-11-25 00:06:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:18,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:06:18,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:18,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291313395] [2023-11-25 00:06:18,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291313395] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:18,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570614412] [2023-11-25 00:06:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:18,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:18,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:18,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:06:18,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:06:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:19,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-25 00:06:19,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:19,020 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:06:19,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-25 00:06:19,240 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-25 00:06:19,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-25 00:06:19,257 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:06:19,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-25 00:06:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:06:19,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:06:19,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570614412] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:19,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1909755993] [2023-11-25 00:06:19,502 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-25 00:06:19,502 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:06:19,502 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:06:19,503 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:06:19,503 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:06:20,586 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-25 00:06:20,694 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:06:23,378 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1566#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-25 00:06:23,378 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:06:23,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:06:23,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-25 00:06:23,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921481764] [2023-11-25 00:06:23,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:06:23,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-25 00:06:23,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:23,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-25 00:06:23,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2023-11-25 00:06:23,381 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-25 00:06:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:24,065 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2023-11-25 00:06:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-25 00:06:24,066 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 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 19 [2023-11-25 00:06:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:24,067 INFO L225 Difference]: With dead ends: 99 [2023-11-25 00:06:24,067 INFO L226 Difference]: Without dead ends: 99 [2023-11-25 00:06:24,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2023-11-25 00:06:24,069 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 4 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:24,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 639 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-25 00:06:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-25 00:06:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-11-25 00:06:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 49 states have (on average 2.020408163265306) internal successors, (99), 92 states have internal predecessors, (99), 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:06:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-11-25 00:06:24,077 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 19 [2023-11-25 00:06:24,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:24,078 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-11-25 00:06:24,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-25 00:06:24,078 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-11-25 00:06:24,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-25 00:06:24,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:24,079 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:24,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-25 00:06:24,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:24,285 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:24,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:24,286 INFO L85 PathProgramCache]: Analyzing trace with hash -179497255, now seen corresponding path program 1 times [2023-11-25 00:06:24,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:24,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733644473] [2023-11-25 00:06:24,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:24,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:06:24,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733644473] [2023-11-25 00:06:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733644473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545635254] [2023-11-25 00:06:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:24,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:24,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:24,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:06:24,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:06:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:25,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-25 00:06:25,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:25,070 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:06:25,114 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-25 00:06:25,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-25 00:06:25,185 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-25 00:06:25,207 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-25 00:06:25,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-11-25 00:06:25,329 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-25 00:06:25,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-25 00:06:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2023-11-25 00:06:25,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:06:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:06:25,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545635254] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:06:25,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [126649716] [2023-11-25 00:06:25,973 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-25 00:06:25,973 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:06:25,974 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:06:25,974 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:06:25,974 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:06:27,145 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-25 00:06:27,163 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:06:31,214 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1963#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (or (and (exists ((|v_#length_124| (Array Int Int))) (= (store |v_#length_124| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (and (= |v_#memory_int_106| (store |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1))))) (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#length_BEFORE_CALL_57| (Array Int Int)) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int) (|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (and (<= 4 (select |v_#length_BEFORE_CALL_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_32| (store |v_#memory_int_109| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_109| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))) (= (select (select (store |v_#memory_$Pointer$.base_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 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|))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_153| (Array Int Int))) (and (= (store |v_#valid_153| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_153| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|))) (and (exists ((|v_#length_124| (Array Int Int))) (= (store |v_#length_124| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (exists ((|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int)))) (and (= |v_#memory_int_106| (store |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_105| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_106| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1))))) (exists ((|v_#memory_$Pointer$.offset_130| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_153| (Array Int Int))) (and (= (store |v_#valid_153| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_153| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_109| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_old(#length)_AFTER_CALL_33| (Array Int Int)) (|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= |v_old(#memory_int)_AFTER_CALL_33| (store |v_#memory_int_109| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_109| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= (select (select (store |v_#memory_$Pointer$.base_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_134| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 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|))))) (not (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_prepend_#in~head#1.base|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1))' at error location [2023-11-25 00:06:31,215 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:06:31,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:06:31,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2023-11-25 00:06:31,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113179707] [2023-11-25 00:06:31,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:06:31,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-25 00:06:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:31,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-25 00:06:31,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1190, Unknown=5, NotChecked=70, Total=1406 [2023-11-25 00:06:31,218 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-25 00:06:31,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:31,840 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2023-11-25 00:06:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:06:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2023-11-25 00:06:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:31,842 INFO L225 Difference]: With dead ends: 105 [2023-11-25 00:06:31,842 INFO L226 Difference]: Without dead ends: 105 [2023-11-25 00:06:31,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=178, Invalid=1381, Unknown=5, NotChecked=76, Total=1640 [2023-11-25 00:06:31,844 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 263 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:31,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 329 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 537 Invalid, 0 Unknown, 109 Unchecked, 0.5s Time] [2023-11-25 00:06:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-25 00:06:31,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-11-25 00:06:31,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.836734693877551) internal successors, (90), 83 states have internal predecessors, (90), 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:06:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-11-25 00:06:31,850 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 27 [2023-11-25 00:06:31,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:31,851 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-11-25 00:06:31,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-25 00:06:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-11-25 00:06:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-25 00:06:31,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:31,852 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:31,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:06:32,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:32,053 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:32,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:32,054 INFO L85 PathProgramCache]: Analyzing trace with hash -179497254, now seen corresponding path program 1 times [2023-11-25 00:06:32,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:32,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198220081] [2023-11-25 00:06:32,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:32,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-25 00:06:32,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:32,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198220081] [2023-11-25 00:06:32,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198220081] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677352166] [2023-11-25 00:06:32,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:32,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:32,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:32,649 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:06:32,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-25 00:06:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:32,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-25 00:06:32,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:32,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-25 00:06:32,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-25 00:06:32,860 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-25 00:06:32,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:06:32,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-25 00:06:32,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-25 00:06:32,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:06:32,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-25 00:06:33,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-25 00:06:33,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:06:33,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-25 00:06:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-25 00:06:33,055 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:06:33,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677352166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:33,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-25 00:06:33,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-11-25 00:06:33,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606425400] [2023-11-25 00:06:33,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:33,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:06:33,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:33,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:06:33,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2023-11-25 00:06:33,058 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:06:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:33,230 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2023-11-25 00:06:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:06:33,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-25 00:06:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:33,231 INFO L225 Difference]: With dead ends: 82 [2023-11-25 00:06:33,232 INFO L226 Difference]: Without dead ends: 82 [2023-11-25 00:06:33,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2023-11-25 00:06:33,233 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:33,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 209 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2023-11-25 00:06:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-25 00:06:33,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-25 00:06:33,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 77 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:06:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-11-25 00:06:33,237 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 27 [2023-11-25 00:06:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:33,237 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-11-25 00:06:33,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:06:33,238 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-11-25 00:06:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-25 00:06:33,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:33,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:33,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-25 00:06:33,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-25 00:06:33,453 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:33,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash -168434192, now seen corresponding path program 1 times [2023-11-25 00:06:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:33,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248188831] [2023-11-25 00:06:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:33,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-25 00:06:33,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248188831] [2023-11-25 00:06:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248188831] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:33,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:06:33,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:06:33,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309744330] [2023-11-25 00:06:33,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:33,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:06:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:33,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:06:33,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:06:33,605 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-25 00:06:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:33,758 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2023-11-25 00:06:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:06:33,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-25 00:06:33,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:33,759 INFO L225 Difference]: With dead ends: 80 [2023-11-25 00:06:33,759 INFO L226 Difference]: Without dead ends: 80 [2023-11-25 00:06:33,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:06:33,760 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:33,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 212 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:06:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-25 00:06:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-25 00:06:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 75 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:06:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-11-25 00:06:33,764 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 30 [2023-11-25 00:06:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:33,765 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-11-25 00:06:33,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-25 00:06:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-11-25 00:06:33,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-25 00:06:33,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:33,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:33,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-25 00:06:33,766 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:33,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash -168434191, now seen corresponding path program 1 times [2023-11-25 00:06:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:33,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197027695] [2023-11-25 00:06:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-25 00:06:33,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:33,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197027695] [2023-11-25 00:06:33,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197027695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:33,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:06:33,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:06:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277067105] [2023-11-25 00:06:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:33,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:06:33,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:33,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:06:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:06:33,989 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-25 00:06:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:34,152 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2023-11-25 00:06:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:06:34,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2023-11-25 00:06:34,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:34,154 INFO L225 Difference]: With dead ends: 78 [2023-11-25 00:06:34,154 INFO L226 Difference]: Without dead ends: 78 [2023-11-25 00:06:34,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:06:34,155 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:34,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 224 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:06:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-25 00:06:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-25 00:06:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 73 states have internal predecessors, (80), 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:06:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2023-11-25 00:06:34,158 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 30 [2023-11-25 00:06:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:34,159 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2023-11-25 00:06:34,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-25 00:06:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2023-11-25 00:06:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-25 00:06:34,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:34,161 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:34,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-25 00:06:34,161 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:34,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash -168420942, now seen corresponding path program 1 times [2023-11-25 00:06:34,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:34,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106540017] [2023-11-25 00:06:34,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:34,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:06:34,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106540017] [2023-11-25 00:06:34,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106540017] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533699014] [2023-11-25 00:06:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:34,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:34,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:34,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:06:34,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-25 00:06:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:34,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-25 00:06:34,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:34,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:06:35,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-25 00:06:35,313 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-25 00:06:35,347 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-25 00:06:35,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-25 00:06:35,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:06:35,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-25 00:06:35,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-25 00:06:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-25 00:06:35,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:06:35,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533699014] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:35,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1194680331] [2023-11-25 00:06:35,549 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-25 00:06:35,550 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:06:35,550 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:06:35,550 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:06:35,550 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:06:36,884 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-25 00:06:36,907 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:06:43,658 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2899#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) 1)) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (or (and (exists ((|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_int_121| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_$Pointer$.offset_146| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_150| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_150| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_old(#length)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select (select (store |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= 1 (select |v_old(#valid)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (store |v_#memory_int_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_#memory_int_BEFORE_CALL_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0))) |v_#memory_int_BEFORE_CALL_80|))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#valid_164| (Array Int Int))) (and (= (select |v_#valid_164| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_164| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_135| (Array Int Int))) (= (store |v_#length_135| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int)))) (and (= |v_#memory_int_118| (store |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1)))))) (and (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.base_146| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_146| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#valid_164| (Array Int Int))) (and (= (select |v_#valid_164| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_164| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_old(#memory_int)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$.base_150| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_int_121| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$.offset_146| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_150| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_150| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select (select (store |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_146| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_48| (store |v_#memory_int_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_121| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (<= 4 (select |v_old(#length)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1))) (exists ((|v_#length_135| (Array Int Int))) (= (store |v_#length_135| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_142| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_142| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_int_117| (Array Int (Array Int Int)))) (and (= |v_#memory_int_118| (store |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_117| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_118| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1))))))) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)))' at error location [2023-11-25 00:06:43,658 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:06:43,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:06:43,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-11-25 00:06:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648383966] [2023-11-25 00:06:43,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:06:43,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-25 00:06:43,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:43,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-25 00:06:43,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1584, Unknown=7, NotChecked=80, Total=1806 [2023-11-25 00:06:43,662 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 24 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 21 states have internal predecessors, (40), 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:06:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:44,708 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-11-25 00:06:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-25 00:06:44,709 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 21 states have internal predecessors, (40), 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 30 [2023-11-25 00:06:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:44,709 INFO L225 Difference]: With dead ends: 81 [2023-11-25 00:06:44,710 INFO L226 Difference]: Without dead ends: 81 [2023-11-25 00:06:44,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=200, Invalid=2244, Unknown=10, NotChecked=96, Total=2550 [2023-11-25 00:06:44,711 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 96 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:44,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 470 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 867 Invalid, 0 Unknown, 89 Unchecked, 0.7s Time] [2023-11-25 00:06:44,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-25 00:06:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2023-11-25 00:06:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 72 states have internal predecessors, (80), 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:06:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-11-25 00:06:44,715 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 30 [2023-11-25 00:06:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:44,715 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-11-25 00:06:44,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 21 states have internal predecessors, (40), 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:06:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-11-25 00:06:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-25 00:06:44,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:44,717 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:44,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-25 00:06:44,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-25 00:06:44,918 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:44,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash -168420941, now seen corresponding path program 1 times [2023-11-25 00:06:44,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:44,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385870878] [2023-11-25 00:06:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:06:45,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:45,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385870878] [2023-11-25 00:06:45,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385870878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:45,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761476180] [2023-11-25 00:06:45,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:45,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:45,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:45,961 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:06:45,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-25 00:06:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:46,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-25 00:06:46,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:46,447 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 25 treesize of output 17 [2023-11-25 00:06:46,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-25 00:06:46,529 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-25 00:06:46,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:06:46,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-11-25 00:06:46,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:06:46,555 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 24 treesize of output 19 [2023-11-25 00:06:46,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:06:46,562 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 31 treesize of output 24 [2023-11-25 00:06:46,577 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-25 00:06:46,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-25 00:06:46,644 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 23 treesize of output 15 [2023-11-25 00:06:46,647 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 26 treesize of output 14 [2023-11-25 00:06:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2023-11-25 00:06:46,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:06:46,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761476180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [236467038] [2023-11-25 00:06:46,996 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-25 00:06:46,997 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:06:46,997 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:06:46,997 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:06:46,997 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:06:48,149 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-11-25 00:06:48,169 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:06:55,361 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3224#(and (or (and (exists ((|v_#length_145| (Array Int Int))) (= |#length| (store |v_#length_145| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_130| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_129| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_129| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_130|) (= (store |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1)) |#memory_int|))) (exists ((|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_old(#memory_int)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_162| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_$Pointer$.base_166| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_62| (store |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_166| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_166| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_old(#length)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)) (= (select (select (store |v_#memory_$Pointer$.offset_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_162| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_162| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_#valid_173| (Array Int Int))) (and (= |#valid| (store |v_#valid_173| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_173| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_158| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_158| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_158| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0))) (and (exists ((|v_#length_145| (Array Int Int))) (= |#length| (store |v_#length_145| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 8))) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_130| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_129| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_129| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 (select (select |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) |v_#memory_int_130|) (= (store |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |v_#memory_int_130| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4 1)) |#memory_int|))) (exists ((|v_#memory_$Pointer$.base_162| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_162| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_162| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_#length_BEFORE_CALL_111| (Array Int Int)) (|v_#memory_$Pointer$.offset_162| (Array Int (Array Int Int))) (|v_#memory_int_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_166| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_166| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_166| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select (select (store |v_#memory_$Pointer$.offset_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_162| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)))) (exists ((|v_#valid_173| (Array Int Int))) (and (= |#valid| (store |v_#valid_173| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1)) (= (select |v_#valid_173| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_158| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_158| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_158| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| 0)))) (<= 1 |#StackHeapBarrier|) (or (< |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 4))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_#in~data#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) |ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= 0 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_prepend_~head#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |ULTIMATE.start_sll_circular_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_prepend_~data#1| 1) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_prepend_~head#1.base|)))' at error location [2023-11-25 00:06:55,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:06:55,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:06:55,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2023-11-25 00:06:55,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035709259] [2023-11-25 00:06:55,362 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:06:55,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-25 00:06:55,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:55,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-25 00:06:55,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1829, Unknown=8, NotChecked=86, Total=2070 [2023-11-25 00:06:55,365 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 25 states, 18 states have (on average 2.111111111111111) internal successors, (38), 22 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:06:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:56,911 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-11-25 00:06:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-25 00:06:56,912 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 2.111111111111111) internal successors, (38), 22 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-25 00:06:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:56,914 INFO L225 Difference]: With dead ends: 85 [2023-11-25 00:06:56,914 INFO L226 Difference]: Without dead ends: 85 [2023-11-25 00:06:56,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=225, Invalid=2740, Unknown=9, NotChecked=106, Total=3080 [2023-11-25 00:06:56,916 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 119 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:56,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 602 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 963 Invalid, 0 Unknown, 94 Unchecked, 0.9s Time] [2023-11-25 00:06:56,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-25 00:06:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2023-11-25 00:06:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 79 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:06:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2023-11-25 00:06:56,920 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 30 [2023-11-25 00:06:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:56,920 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2023-11-25 00:06:56,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 2.111111111111111) internal successors, (38), 22 states have internal predecessors, (38), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:06:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2023-11-25 00:06:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-25 00:06:56,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:56,924 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:06:56,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-25 00:06:57,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-25 00:06:57,125 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:57,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:57,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1343500530, now seen corresponding path program 1 times [2023-11-25 00:06:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:57,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681897164] [2023-11-25 00:06:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-25 00:06:57,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:57,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681897164] [2023-11-25 00:06:57,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681897164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:06:57,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:06:57,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:06:57,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594395253] [2023-11-25 00:06:57,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:06:57,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:06:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:06:57,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:06:57,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:06:57,386 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:06:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:06:57,480 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2023-11-25 00:06:57,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:06:57,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-11-25 00:06:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:06:57,481 INFO L225 Difference]: With dead ends: 81 [2023-11-25 00:06:57,481 INFO L226 Difference]: Without dead ends: 81 [2023-11-25 00:06:57,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-25 00:06:57,482 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 149 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:06:57,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 91 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:06:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-25 00:06:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-25 00:06:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 76 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:06:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2023-11-25 00:06:57,486 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 32 [2023-11-25 00:06:57,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:06:57,486 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2023-11-25 00:06:57,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:06:57,486 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2023-11-25 00:06:57,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-25 00:06:57,489 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:06:57,489 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:06:57,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-25 00:06:57,490 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-25 00:06:57,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:06:57,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1301152590, now seen corresponding path program 1 times [2023-11-25 00:06:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:06:57,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653177646] [2023-11-25 00:06:57,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:57,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:06:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:06:57,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:06:57,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653177646] [2023-11-25 00:06:57,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653177646] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:06:57,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625446887] [2023-11-25 00:06:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:06:57,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:06:57,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:06:57,953 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:06:57,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5470aca8-e9b7-42c0-b57d-ab5e95d50ea0/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-25 00:06:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:06:58,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-25 00:06:58,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:06:58,333 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