./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ --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 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:11:52,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:11:52,921 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 05:11:52,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:11:52,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:11:52,955 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:11:52,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:11:52,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:11:52,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:11:52,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:11:52,959 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:11:52,959 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:11:52,960 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:11:52,960 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:11:52,961 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:11:52,962 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:11:52,962 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:11:52,963 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:11:52,963 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:11:52,964 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:11:52,964 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:11:52,965 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:11:52,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:11:52,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:11:52,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:11:52,967 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:11:52,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:11:52,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:11:52,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:11:52,976 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:11:52,977 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:11:52,977 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:11:52,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:11:52,978 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:11:52,978 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:11:52,978 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:11:52,979 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:11:52,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:11:52,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:11:52,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:11:52,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:11:52,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:11:52,980 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:11:52,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:11:52,981 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:11:52,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:11:52,981 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_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/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_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ 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 -> 3340815bef7e21ae2d4803d7059577c1761bb3b7b4bb24b2b34d5d0d0054fd10 [2023-11-19 05:11:53,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:11:53,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:11:53,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:11:53,352 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:11:53,354 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:11:53,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2023-11-19 05:11:56,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:11:56,772 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:11:56,773 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/sv-benchmarks/c/list-simple/sll2c_remove_all_reverse.i [2023-11-19 05:11:56,801 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/data/edeb3d546/6b1dd788ec5444c3b5627dc3f06fbad7/FLAG9ca36d63b [2023-11-19 05:11:56,819 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/data/edeb3d546/6b1dd788ec5444c3b5627dc3f06fbad7 [2023-11-19 05:11:56,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:11:56,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:11:56,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:11:56,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:11:56,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:11:56,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:11:56" (1/1) ... [2023-11-19 05:11:56,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cf2ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:56, skipping insertion in model container [2023-11-19 05:11:56,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:11:56" (1/1) ... [2023-11-19 05:11:56,874 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:11:57,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:11:57,301 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:11:57,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:11:57,378 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:11:57,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57 WrapperNode [2023-11-19 05:11:57,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:11:57,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:11:57,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:11:57,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:11:57,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,434 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 129 [2023-11-19 05:11:57,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:11:57,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:11:57,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:11:57,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:11:57,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:11:57,488 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:11:57,488 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:11:57,489 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:11:57,489 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (1/1) ... [2023-11-19 05:11:57,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:11:57,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:11:57,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:11:57,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:11:57,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:11:57,597 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 05:11:57,597 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 05:11:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:11:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:11:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:11:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 05:11:57,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 05:11:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:11:57,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 05:11:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:11:57,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:11:57,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:11:57,766 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:11:57,773 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:11:58,102 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:11:58,154 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:11:58,154 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 05:11:58,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:11:58 BoogieIcfgContainer [2023-11-19 05:11:58,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:11:58,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:11:58,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:11:58,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:11:58,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:11:56" (1/3) ... [2023-11-19 05:11:58,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58631b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:11:58, skipping insertion in model container [2023-11-19 05:11:58,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:11:57" (2/3) ... [2023-11-19 05:11:58,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58631b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:11:58, skipping insertion in model container [2023-11-19 05:11:58,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:11:58" (3/3) ... [2023-11-19 05:11:58,168 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_remove_all_reverse.i [2023-11-19 05:11:58,186 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:11:58,186 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-19 05:11:58,230 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:11:58,243 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;@62c53f33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:11:58,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2023-11-19 05:11:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 40 states have (on average 2.3) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:11:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:11:58,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:58,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:11:58,257 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:11:58,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash 195338784, now seen corresponding path program 1 times [2023-11-19 05:11:58,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:58,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111887217] [2023-11-19 05:11:58,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:58,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:58,517 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-19 05:11:58,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:58,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111887217] [2023-11-19 05:11:58,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111887217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:58,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:58,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:11:58,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367817719] [2023-11-19 05:11:58,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:58,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:11:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:11:58,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:11:58,559 INFO L87 Difference]: Start difference. First operand has 86 states, 40 states have (on average 2.3) internal successors, (92), 82 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 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-19 05:11:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:58,688 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-11-19 05:11:58,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:11:58,690 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-19 05:11:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:58,698 INFO L225 Difference]: With dead ends: 83 [2023-11-19 05:11:58,698 INFO L226 Difference]: Without dead ends: 81 [2023-11-19 05:11:58,699 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-19 05:11:58,703 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 107 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-19 05:11:58,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 107 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:11:58,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-19 05:11:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-19 05:11:58,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 77 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:11:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-11-19 05:11:58,742 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 5 [2023-11-19 05:11:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:58,743 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-11-19 05:11:58,743 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-19 05:11:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-11-19 05:11:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:11:58,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:58,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:11:58,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:11:58,745 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:11:58,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash 195338785, now seen corresponding path program 1 times [2023-11-19 05:11:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:58,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241224380] [2023-11-19 05:11:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:58,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:58,957 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-19 05:11:58,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:58,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241224380] [2023-11-19 05:11:58,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241224380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:58,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:58,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:11:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992689258] [2023-11-19 05:11:58,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:58,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:11:58,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:58,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:11:58,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:11:58,966 INFO L87 Difference]: Start difference. First operand 81 states and 86 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-19 05:11:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:59,054 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2023-11-19 05:11:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:11:59,054 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-19 05:11:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:59,056 INFO L225 Difference]: With dead ends: 79 [2023-11-19 05:11:59,056 INFO L226 Difference]: Without dead ends: 79 [2023-11-19 05:11:59,056 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-19 05:11:59,058 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:59,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 112 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:11:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-19 05:11:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-19 05:11:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 75 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:11:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-11-19 05:11:59,068 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 5 [2023-11-19 05:11:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:59,068 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-11-19 05:11:59,069 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-19 05:11:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-11-19 05:11:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 05:11:59,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:59,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:59,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:11:59,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:11:59,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1252575947, now seen corresponding path program 1 times [2023-11-19 05:11:59,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:59,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920847893] [2023-11-19 05:11:59,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:59,156 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-19 05:11:59,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920847893] [2023-11-19 05:11:59,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920847893] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:59,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:59,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:11:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714779646] [2023-11-19 05:11:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:59,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:11:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:11:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:11:59,160 INFO L87 Difference]: Start difference. First operand 79 states and 84 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-19 05:11:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:59,199 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-11-19 05:11:59,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:11:59,199 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-19 05:11:59,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:59,201 INFO L225 Difference]: With dead ends: 85 [2023-11-19 05:11:59,201 INFO L226 Difference]: Without dead ends: 85 [2023-11-19 05:11:59,201 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-19 05:11:59,203 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:59,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 138 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:11:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-19 05:11:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2023-11-19 05:11:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 39 states have (on average 2.076923076923077) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:11:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2023-11-19 05:11:59,213 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 10 [2023-11-19 05:11:59,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:59,214 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2023-11-19 05:11:59,214 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-19 05:11:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2023-11-19 05:11:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:11:59,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:59,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:59,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:11:59,216 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:11:59,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash 901173839, now seen corresponding path program 1 times [2023-11-19 05:11:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:59,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599478135] [2023-11-19 05:11:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:59,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:59,411 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-19 05:11:59,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:59,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599478135] [2023-11-19 05:11:59,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599478135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:59,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:59,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:11:59,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439491247] [2023-11-19 05:11:59,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:59,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:11:59,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:59,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:11:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:11:59,418 INFO L87 Difference]: Start difference. First operand 80 states and 85 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-19 05:11:59,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:11:59,592 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2023-11-19 05:11:59,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:11:59,593 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-19 05:11:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:11:59,595 INFO L225 Difference]: With dead ends: 79 [2023-11-19 05:11:59,596 INFO L226 Difference]: Without dead ends: 79 [2023-11-19 05:11:59,596 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-19 05:11:59,607 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:11:59,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 206 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:11:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-19 05:11:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-19 05:11:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 39 states have (on average 2.051282051282051) internal successors, (80), 75 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:11:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-11-19 05:11:59,617 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 17 [2023-11-19 05:11:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:11:59,617 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-11-19 05:11:59,618 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-19 05:11:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-11-19 05:11:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:11:59,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:11:59,619 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:11:59,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:11:59,619 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:11:59,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:11:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 901173840, now seen corresponding path program 1 times [2023-11-19 05:11:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:11:59,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892220023] [2023-11-19 05:11:59,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:11:59,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:11:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:11:59,990 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-19 05:11:59,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:11:59,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892220023] [2023-11-19 05:11:59,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892220023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:11:59,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:11:59,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:11:59,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110377731] [2023-11-19 05:11:59,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:11:59,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:11:59,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:11:59,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:11:59,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:11:59,994 INFO L87 Difference]: Start difference. First operand 79 states and 84 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-19 05:12:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:00,168 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-11-19 05:12:00,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:12:00,168 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-19 05:12:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:00,171 INFO L225 Difference]: With dead ends: 78 [2023-11-19 05:12:00,171 INFO L226 Difference]: Without dead ends: 78 [2023-11-19 05:12:00,171 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-19 05:12:00,177 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 1 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:00,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 230 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:12:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-19 05:12:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-19 05:12:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 74 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:12:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2023-11-19 05:12:00,194 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 17 [2023-11-19 05:12:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:00,194 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2023-11-19 05:12:00,194 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-19 05:12:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2023-11-19 05:12:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:12:00,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:00,196 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:00,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:12:00,196 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:00,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:00,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1555175025, now seen corresponding path program 1 times [2023-11-19 05:12:00,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:00,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584623947] [2023-11-19 05:12:00,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:00,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:00,492 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-19 05:12:00,492 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:00,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584623947] [2023-11-19 05:12:00,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584623947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:00,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996311826] [2023-11-19 05:12:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:00,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:12:00,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:12:00,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:12:00,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:12:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:00,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-19 05:12:00,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:12:00,749 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-19 05:12:00,883 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-19 05:12:00,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-19 05:12:00,914 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-19 05:12:00,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:12:01,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996311826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:01,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [27034133] [2023-11-19 05:12:01,060 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 05:12:01,061 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:12:01,065 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:12:01,071 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:12:01,071 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:12:02,659 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-19 05:12:02,783 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:12:04,660 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '998#(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-19 05:12:04,660 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:12:04,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:12:04,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-11-19 05:12:04,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958392015] [2023-11-19 05:12:04,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:12:04,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-19 05:12:04,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:04,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-19 05:12:04,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2023-11-19 05:12:04,663 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 13 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 05:12:05,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:05,038 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2023-11-19 05:12:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 05:12:05,040 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-11-19 05:12:05,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:05,041 INFO L225 Difference]: With dead ends: 77 [2023-11-19 05:12:05,041 INFO L226 Difference]: Without dead ends: 77 [2023-11-19 05:12:05,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2023-11-19 05:12:05,042 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:05,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 344 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:12:05,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-19 05:12:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-19 05:12:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 39 states have (on average 2.0) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:12:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2023-11-19 05:12:05,048 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 19 [2023-11-19 05:12:05,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:05,049 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2023-11-19 05:12:05,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 05:12:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2023-11-19 05:12:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 05:12:05,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:05,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:05,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:12:05,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:12:05,267 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:05,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:05,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1555175024, now seen corresponding path program 1 times [2023-11-19 05:12:05,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:05,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976550809] [2023-11-19 05:12:05,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:05,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:05,539 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-19 05:12:05,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:05,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976550809] [2023-11-19 05:12:05,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976550809] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:05,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561861834] [2023-11-19 05:12:05,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:05,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:12:05,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:12:05,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:12:05,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:12:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:05,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-19 05:12:05,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:12:05,672 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-19 05:12:05,677 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-19 05:12:05,903 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 05:12:05,904 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-19 05:12:05,923 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:12:05,923 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-19 05:12:05,987 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-19 05:12:05,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:12:06,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561861834] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:06,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [823455468] [2023-11-19 05:12:06,159 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 05:12:06,159 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:12:06,159 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:12:06,159 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:12:06,160 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:12:07,254 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-19 05:12:07,366 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:12:09,350 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1257#(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-19 05:12:09,350 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:12:09,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:12:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-19 05:12:09,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509445561] [2023-11-19 05:12:09,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:12:09,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 05:12:09,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:09,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 05:12:09,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2023-11-19 05:12:09,353 INFO L87 Difference]: Start difference. First operand 77 states and 82 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-19 05:12:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:09,986 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2023-11-19 05:12:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 05:12:09,987 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-19 05:12:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:09,988 INFO L225 Difference]: With dead ends: 78 [2023-11-19 05:12:09,988 INFO L226 Difference]: Without dead ends: 78 [2023-11-19 05:12:09,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2023-11-19 05:12:09,990 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:09,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 492 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-19 05:12:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-19 05:12:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-11-19 05:12:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 72 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:12:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2023-11-19 05:12:09,996 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2023-11-19 05:12:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:09,997 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2023-11-19 05:12:09,997 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-19 05:12:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2023-11-19 05:12:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 05:12:09,998 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:09,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:10,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 05:12:10,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-19 05:12:10,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:10,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:10,211 INFO L85 PathProgramCache]: Analyzing trace with hash 125572014, now seen corresponding path program 1 times [2023-11-19 05:12:10,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:10,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103498010] [2023-11-19 05:12:10,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:10,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 05:12:10,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:10,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103498010] [2023-11-19 05:12:10,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103498010] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:10,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010891442] [2023-11-19 05:12:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:10,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:12:10,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:12:10,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:12:10,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:12:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:10,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-19 05:12:10,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:12:10,667 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-19 05:12:10,680 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-19 05:12:10,741 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-19 05:12:10,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-19 05:12:10,783 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse0 (select |c_#valid| .cse0))))))) is different from false [2023-11-19 05:12:10,786 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse0 (select |c_#valid| .cse0))))))) is different from true [2023-11-19 05:12:10,801 WARN L854 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse0 (select |c_#valid| .cse0))))))) is different from false [2023-11-19 05:12:10,803 WARN L876 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse0 (select |c_#valid| .cse0))))))) is different from true [2023-11-19 05:12:10,827 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) is different from false [2023-11-19 05:12:10,836 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) is different from true [2023-11-19 05:12:10,875 WARN L854 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1)))) is different from false [2023-11-19 05:12:10,877 WARN L876 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1)))) is different from true [2023-11-19 05:12:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-11-19 05:12:10,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:12:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010891442] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:11,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [128779826] [2023-11-19 05:12:11,118 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 05:12:11,118 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:12:11,119 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:12:11,119 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:12:11,119 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:12:12,385 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-19 05:12:12,492 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:12:14,418 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1560#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1)) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_101| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| Int) (|v_#memory_$Pointer$.offset_101| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.base_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|))) (= |#memory_int| (store |v_#memory_int_82| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_int_82| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0)))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16| (store (select |v_#memory_$Pointer$.offset_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_16|) 0 0))))) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-19 05:12:14,419 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:12:14,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:12:14,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-19 05:12:14,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753661788] [2023-11-19 05:12:14,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:12:14,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 05:12:14,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 05:12:14,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=808, Unknown=9, NotChecked=310, Total=1260 [2023-11-19 05:12:14,422 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 16 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-19 05:12:14,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse1 (select |c_#valid| .cse1))))))))) is different from false [2023-11-19 05:12:14,549 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse1 (select |c_#valid| .cse1))))))))) is different from true [2023-11-19 05:12:14,552 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse1 (select |c_#valid| .cse1))))))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-19 05:12:14,554 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| .cse1 (select |c_#valid| .cse1))))))) (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-19 05:12:14,558 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25|) 1)) .cse0)))) is different from false [2023-11-19 05:12:14,560 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25|) 1)) .cse0)))) is different from true [2023-11-19 05:12:14,564 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25|) 1)) .cse0)))) is different from false [2023-11-19 05:12:14,566 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25|) 1)) .cse0)))) is different from true [2023-11-19 05:12:14,569 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and .cse0 (or (and (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1)))))) is different from false [2023-11-19 05:12:14,572 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (and .cse0 (or (and (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25| Int)) (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_25|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_44| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_44| (@diff |v_#valid_BEFORE_CALL_44| |c_#valid|) 1)) (= (select |v_#valid_BEFORE_CALL_44| |c_ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1)))))) is different from true [2023-11-19 05:12:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:14,907 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2023-11-19 05:12:14,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 05:12:14,908 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 21 [2023-11-19 05:12:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:14,909 INFO L225 Difference]: With dead ends: 125 [2023-11-19 05:12:14,909 INFO L226 Difference]: Without dead ends: 125 [2023-11-19 05:12:14,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=174, Invalid=969, Unknown=19, NotChecked=730, Total=1892 [2023-11-19 05:12:14,911 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 175 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 764 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:14,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 267 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 419 Invalid, 0 Unknown, 764 Unchecked, 0.4s Time] [2023-11-19 05:12:14,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-19 05:12:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 85. [2023-11-19 05:12:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.88) internal successors, (94), 80 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:12:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2023-11-19 05:12:14,917 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 21 [2023-11-19 05:12:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:14,917 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2023-11-19 05:12:14,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-19 05:12:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2023-11-19 05:12:14,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 05:12:14,918 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:14,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:14,942 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:12:15,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-19 05:12:15,120 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:15,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:15,120 INFO L85 PathProgramCache]: Analyzing trace with hash 125572015, now seen corresponding path program 1 times [2023-11-19 05:12:15,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:15,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183858383] [2023-11-19 05:12:15,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:15,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:12:15,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:15,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183858383] [2023-11-19 05:12:15,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183858383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:15,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985464219] [2023-11-19 05:12:15,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:15,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:12:15,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:12:15,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:12:15,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:12:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:15,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-19 05:12:15,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:12:15,746 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-19 05:12:15,780 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-19 05:12:15,789 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-19 05:12:15,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:12:15,831 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-19 05:12:15,862 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-19 05:12:15,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 05:12:15,930 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-19 05:12:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 05:12:15,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:12:16,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985464219] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:16,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1954568150] [2023-11-19 05:12:16,159 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 05:12:16,160 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:12:16,160 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:12:16,160 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:12:16,160 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:12:17,186 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-19 05:12:17,277 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:12:19,241 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1900#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 3) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int))) (|v_#memory_int_96| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_115| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0))) (= |#memory_int| (store |v_#memory_int_96| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_96| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_115| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|))))) (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-19 05:12:19,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:12:19,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:12:19,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2023-11-19 05:12:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890465568] [2023-11-19 05:12:19,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:12:19,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 05:12:19,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:19,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 05:12:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=876, Unknown=1, NotChecked=60, Total=1056 [2023-11-19 05:12:19,244 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 16 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 05:12:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:19,625 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2023-11-19 05:12:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:12:19,626 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 21 [2023-11-19 05:12:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:19,627 INFO L225 Difference]: With dead ends: 77 [2023-11-19 05:12:19,627 INFO L226 Difference]: Without dead ends: 77 [2023-11-19 05:12:19,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=160, Invalid=1103, Unknown=1, NotChecked=68, Total=1332 [2023-11-19 05:12:19,628 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 213 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:19,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 154 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 295 Invalid, 0 Unknown, 65 Unchecked, 0.3s Time] [2023-11-19 05:12:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-19 05:12:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-19 05:12:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.64) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:12:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2023-11-19 05:12:19,633 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 21 [2023-11-19 05:12:19,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:19,634 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2023-11-19 05:12:19,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.5) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 05:12:19,634 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2023-11-19 05:12:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-19 05:12:19,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:19,635 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:19,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 05:12:19,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-19 05:12:19,836 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:19,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash 125576722, now seen corresponding path program 1 times [2023-11-19 05:12:19,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:19,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323806614] [2023-11-19 05:12:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 05:12:19,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323806614] [2023-11-19 05:12:19,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323806614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:12:19,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:12:19,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:12:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648894473] [2023-11-19 05:12:19,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:12:19,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:12:19,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:19,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:12:19,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:12:19,916 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:12:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:19,955 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2023-11-19 05:12:19,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:12:19,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-11-19 05:12:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:19,957 INFO L225 Difference]: With dead ends: 115 [2023-11-19 05:12:19,957 INFO L226 Difference]: Without dead ends: 115 [2023-11-19 05:12:19,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:12:19,958 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 142 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:19,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 107 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:12:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-19 05:12:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2023-11-19 05:12:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 71 states have internal predecessors, (79), 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-19 05:12:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-19 05:12:19,973 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2023-11-19 05:12:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:19,974 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-19 05:12:19,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:12:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-19 05:12:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:12:19,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:19,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:19,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 05:12:19,977 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:19,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:19,978 INFO L85 PathProgramCache]: Analyzing trace with hash -402230600, now seen corresponding path program 1 times [2023-11-19 05:12:19,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:19,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145035481] [2023-11-19 05:12:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:20,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 05:12:20,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145035481] [2023-11-19 05:12:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145035481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:12:20,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:12:20,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 05:12:20,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77816663] [2023-11-19 05:12:20,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:12:20,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 05:12:20,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 05:12:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:12:20,225 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-19 05:12:20,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:20,528 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2023-11-19 05:12:20,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 05:12:20,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 22 [2023-11-19 05:12:20,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:20,529 INFO L225 Difference]: With dead ends: 105 [2023-11-19 05:12:20,530 INFO L226 Difference]: Without dead ends: 105 [2023-11-19 05:12:20,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-19 05:12:20,530 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 127 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:20,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 167 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:12:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-19 05:12:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2023-11-19 05:12:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 70 states have internal predecessors, (78), 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-19 05:12:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-19 05:12:20,534 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 22 [2023-11-19 05:12:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:20,534 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-19 05:12:20,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-19 05:12:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-19 05:12:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:12:20,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:20,536 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:20,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 05:12:20,536 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:20,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash -402230599, now seen corresponding path program 1 times [2023-11-19 05:12:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:20,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532238306] [2023-11-19 05:12:20,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:20,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:20,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:12:20,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:20,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532238306] [2023-11-19 05:12:20,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532238306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:12:20,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:12:20,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 05:12:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566832953] [2023-11-19 05:12:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:12:20,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 05:12:20,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:20,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 05:12:20,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:12:20,890 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 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-19 05:12:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:21,274 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2023-11-19 05:12:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 05:12:21,276 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 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 22 [2023-11-19 05:12:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:21,278 INFO L225 Difference]: With dead ends: 143 [2023-11-19 05:12:21,278 INFO L226 Difference]: Without dead ends: 143 [2023-11-19 05:12:21,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-19 05:12:21,279 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 182 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:21,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 233 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:12:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-19 05:12:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 85. [2023-11-19 05:12:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.55) internal successors, (93), 80 states have internal predecessors, (93), 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-19 05:12:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2023-11-19 05:12:21,285 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 22 [2023-11-19 05:12:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:21,288 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2023-11-19 05:12:21,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 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-19 05:12:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2023-11-19 05:12:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 05:12:21,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:21,292 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:21,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 05:12:21,293 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:21,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash 415753306, now seen corresponding path program 1 times [2023-11-19 05:12:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:21,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846678786] [2023-11-19 05:12:21,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:21,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 05:12:21,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:21,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846678786] [2023-11-19 05:12:21,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846678786] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:12:21,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:12:21,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:12:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503526682] [2023-11-19 05:12:21,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:12:21,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:12:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:21,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:12:21,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:12:21,363 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:12:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:21,420 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2023-11-19 05:12:21,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:12:21,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-11-19 05:12:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:21,422 INFO L225 Difference]: With dead ends: 84 [2023-11-19 05:12:21,422 INFO L226 Difference]: Without dead ends: 84 [2023-11-19 05:12:21,423 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-19 05:12:21,424 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:21,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 51 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:12:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-19 05:12:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2023-11-19 05:12:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 71 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:12:21,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2023-11-19 05:12:21,429 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 23 [2023-11-19 05:12:21,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:21,429 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2023-11-19 05:12:21,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:12:21,430 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2023-11-19 05:12:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 05:12:21,432 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:21,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:21,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 05:12:21,432 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:21,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:21,433 INFO L85 PathProgramCache]: Analyzing trace with hash -978913990, now seen corresponding path program 1 times [2023-11-19 05:12:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:21,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982831022] [2023-11-19 05:12:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:21,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:22,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:12:22,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982831022] [2023-11-19 05:12:22,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982831022] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:22,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336475059] [2023-11-19 05:12:22,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:22,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:12:22,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:12:22,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:12:22,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 05:12:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:22,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-19 05:12:22,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:12:22,327 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-19 05:12:22,514 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:12:22,515 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-19 05:12:22,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:12:22,703 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-19 05:12:22,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-11-19 05:12:22,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 05:12:22,884 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:12:22,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 20 [2023-11-19 05:12:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:12:22,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:12:22,911 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 32 treesize of output 24 [2023-11-19 05:12:22,920 INFO L349 Elim1Store]: treesize reduction 5, result has 77.3 percent of original size [2023-11-19 05:12:22,921 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 26 treesize of output 25 [2023-11-19 05:12:22,929 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_678))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select .cse0 .cse1) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (= .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) is different from false [2023-11-19 05:12:22,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:12:22,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 37 [2023-11-19 05:12:22,992 INFO L349 Elim1Store]: treesize reduction 21, result has 67.2 percent of original size [2023-11-19 05:12:22,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 120 [2023-11-19 05:12:23,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:12:23,008 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 93 treesize of output 87 [2023-11-19 05:12:23,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336475059] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:23,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1109021799] [2023-11-19 05:12:23,195 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-19 05:12:23,195 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:12:23,195 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:12:23,196 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:12:23,196 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:12:24,356 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-19 05:12:24,468 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:12:28,022 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3013#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.offset| 0) (or (and (<= 4 (select |#length| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|)) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_#memory_$Pointer$.offset_129| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (and (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= |#memory_int| (store |v_#memory_int_110| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_110| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_131| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_131| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_129| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0))))) (= (select |#valid| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1)) (exists ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_31| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_35| Int)) (and (<= (+ |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_31| 4) (select |#length| |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_35|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_35|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_31|) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset|) (<= 0 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_31|) (= (select |#valid| |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_35|) 1) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_35|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_31|) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base|)))) (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| 0) (= |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_remove_last_#in~head#1.base|) (not (= 1 (select |#valid| |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base|))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (<= 2 |ULTIMATE.start_sll_circular_remove_last_~head#1.base|))' at error location [2023-11-19 05:12:28,023 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:12:28,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:12:28,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2023-11-19 05:12:28,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525610615] [2023-11-19 05:12:28,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:12:28,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-19 05:12:28,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:28,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-19 05:12:28,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1920, Unknown=1, NotChecked=88, Total=2162 [2023-11-19 05:12:28,027 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 27 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:12:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:29,190 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2023-11-19 05:12:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-19 05:12:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-11-19 05:12:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:29,195 INFO L225 Difference]: With dead ends: 144 [2023-11-19 05:12:29,196 INFO L226 Difference]: Without dead ends: 144 [2023-11-19 05:12:29,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=225, Invalid=2640, Unknown=1, NotChecked=104, Total=2970 [2023-11-19 05:12:29,204 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 436 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:29,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 366 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 05:12:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-19 05:12:29,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 87. [2023-11-19 05:12:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 82 states have internal predecessors, (97), 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-19 05:12:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2023-11-19 05:12:29,213 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 26 [2023-11-19 05:12:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:29,214 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2023-11-19 05:12:29,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:12:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2023-11-19 05:12:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-19 05:12:29,218 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:29,218 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:29,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 05:12:29,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-19 05:12:29,431 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:29,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:29,431 INFO L85 PathProgramCache]: Analyzing trace with hash -978913989, now seen corresponding path program 1 times [2023-11-19 05:12:29,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:29,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548605] [2023-11-19 05:12:29,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:29,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:12:30,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548605] [2023-11-19 05:12:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548605] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:30,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959958242] [2023-11-19 05:12:30,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:30,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:12:30,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:12:30,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:12:30,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-19 05:12:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:30,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-19 05:12:30,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:12:30,457 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-19 05:12:30,464 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-19 05:12:30,740 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:12:30,741 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-19 05:12:30,750 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-19 05:12:30,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:12:30,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 05:12:30,944 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-11-19 05:12:30,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 53 [2023-11-19 05:12:30,954 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 36 treesize of output 15 [2023-11-19 05:12:31,248 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:12:31,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2023-11-19 05:12:31,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-19 05:12:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:12:31,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:12:31,618 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_770 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_770))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse0 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_769 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_769) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< 0 (+ (select (select .cse1 .cse2) .cse0) 1)) (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_770 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_770))) (let ((.cse3 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< .cse3 0) (not (= .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_769 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_769))) (let ((.cse5 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (+ 3 (select (select .cse4 .cse5) .cse3)) (select |c_#length| (select (select .cse6 .cse5) .cse3))) (not (= .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))))))))) is different from false [2023-11-19 05:12:31,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:12:31,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2023-11-19 05:12:31,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:12:31,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 56 [2023-11-19 05:12:31,713 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-19 05:12:31,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 74 [2023-11-19 05:12:31,721 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 44 treesize of output 40 [2023-11-19 05:12:31,899 INFO L349 Elim1Store]: treesize reduction 61, result has 64.1 percent of original size [2023-11-19 05:12:31,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 259 [2023-11-19 05:12:31,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:12:31,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 146 [2023-11-19 05:12:32,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:12:32,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 93 [2023-11-19 05:12:32,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:12:32,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 79 [2023-11-19 05:12:32,677 INFO L349 Elim1Store]: treesize reduction 21, result has 73.1 percent of original size [2023-11-19 05:12:32,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 242 treesize of output 250 [2023-11-19 05:12:32,920 INFO L349 Elim1Store]: treesize reduction 67, result has 64.0 percent of original size [2023-11-19 05:12:32,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 567 treesize of output 573 [2023-11-19 05:12:33,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:12:33,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 309 treesize of output 297 [2023-11-19 05:12:33,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:12:33,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 326 treesize of output 320 [2023-11-19 05:12:34,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959958242] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:12:34,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1245026563] [2023-11-19 05:12:34,730 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-19 05:12:34,730 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:12:34,730 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 05:12:34,731 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 05:12:34,731 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 05:12:35,913 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-19 05:12:36,059 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 05:12:40,301 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3431#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (or (< |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset| 4))) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_remove_last_~head#1.offset| 0) (= |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_remove_last_#in~head#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (or (exists ((|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_42| Int) (|v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_38| Int)) (and (= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_38|)) (= (select |#valid| |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_42|) 1) (<= 0 |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_38|) (<= (+ |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_38| 4) (select |#length| |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_42|)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.base_42|) |v_ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset_38|) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base|))) (and (<= 4 (select |#length| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|)) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 0) |ULTIMATE.start_sll_circular_remove_last_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_remove_last_#in~head#1.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_sll_circular_remove_last_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| Int) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 0))) (<= 4 (select |#length| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|)) (= (store |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_124| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21| (store (select |v_#memory_int_124| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0 (select (select |#memory_int| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 0)))) (= (select |#valid| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_21|) 1))) (= (select |#valid| |ULTIMATE.start_sll_circular_remove_last_~head#1.base|) 1))) (<= 2 |ULTIMATE.start_sll_circular_remove_last_~head#1.base|))' at error location [2023-11-19 05:12:40,301 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 05:12:40,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 05:12:40,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2023-11-19 05:12:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198640336] [2023-11-19 05:12:40,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 05:12:40,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-19 05:12:40,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:40,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-19 05:12:40,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3109, Unknown=1, NotChecked=112, Total=3422 [2023-11-19 05:12:40,304 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 32 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:12:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:42,269 INFO L93 Difference]: Finished difference Result 185 states and 209 transitions. [2023-11-19 05:12:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 05:12:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2023-11-19 05:12:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:42,271 INFO L225 Difference]: With dead ends: 185 [2023-11-19 05:12:42,271 INFO L226 Difference]: Without dead ends: 185 [2023-11-19 05:12:42,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=312, Invalid=4661, Unknown=1, NotChecked=138, Total=5112 [2023-11-19 05:12:42,274 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 612 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:42,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 701 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-19 05:12:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-19 05:12:42,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 86. [2023-11-19 05:12:42,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.532258064516129) internal successors, (95), 81 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:12:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2023-11-19 05:12:42,279 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 26 [2023-11-19 05:12:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:42,280 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2023-11-19 05:12:42,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:12:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2023-11-19 05:12:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-19 05:12:42,281 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:42,281 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:42,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-19 05:12:42,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e25d7ad7-86e4-480f-b1de-a5d53637c834/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-19 05:12:42,502 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:42,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash -143739305, now seen corresponding path program 1 times [2023-11-19 05:12:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:42,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020173126] [2023-11-19 05:12:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:42,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-19 05:12:42,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:42,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020173126] [2023-11-19 05:12:42,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020173126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:12:42,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:12:42,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:12:42,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927989918] [2023-11-19 05:12:42,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:12:42,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:12:42,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:42,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:12:42,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:12:42,589 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:12:42,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:12:42,690 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2023-11-19 05:12:42,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:12:42,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-11-19 05:12:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:12:42,693 INFO L225 Difference]: With dead ends: 110 [2023-11-19 05:12:42,693 INFO L226 Difference]: Without dead ends: 110 [2023-11-19 05:12:42,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:12:42,695 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:12:42,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 108 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:12:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-19 05:12:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2023-11-19 05:12:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 89 states have internal predecessors, (107), 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-19 05:12:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2023-11-19 05:12:42,703 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 28 [2023-11-19 05:12:42,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:12:42,704 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2023-11-19 05:12:42,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-19 05:12:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2023-11-19 05:12:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-19 05:12:42,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:12:42,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:12:42,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 05:12:42,708 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2023-11-19 05:12:42,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:12:42,709 INFO L85 PathProgramCache]: Analyzing trace with hash -143756220, now seen corresponding path program 1 times [2023-11-19 05:12:42,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:12:42,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857503973] [2023-11-19 05:12:42,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:12:42,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:12:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:12:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 05:12:42,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:12:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857503973] [2023-11-19 05:12:42,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857503973] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:12:42,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:12:42,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-19 05:12:42,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377189777] [2023-11-19 05:12:42,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:12:42,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 05:12:42,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:12:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 05:12:42,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-19 05:12:42,908 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 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)