./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/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_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/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_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/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 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:47:58,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:47:58,279 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 04:47:58,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:47:58,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:47:58,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:47:58,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:47:58,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:47:58,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:47:58,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:47:58,314 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:47:58,315 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:47:58,315 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:47:58,316 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:47:58,317 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:47:58,317 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:47:58,318 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:47:58,318 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:47:58,319 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:47:58,319 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:47:58,320 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:47:58,321 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:47:58,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:47:58,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:47:58,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:47:58,328 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:47:58,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:47:58,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:47:58,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:47:58,332 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:47:58,333 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:47:58,335 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:47:58,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:47:58,336 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:47:58,337 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:47:58,337 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:47:58,338 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:47:58,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:47:58,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:47:58,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:47:58,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:47:58,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:47:58,341 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:47:58,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:47:58,342 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:47:58,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:47:58,342 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_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/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_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/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 -> 383c6933c6ab916f651364224af1d774f30e162ad506fd2f28fe7f76c4487ba3 [2023-11-19 04:47:58,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:47:58,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:47:58,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:47:58,630 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:47:58,630 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:47:58,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-19 04:48:01,780 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:48:02,136 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:48:02,136 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/sv-benchmarks/c/list-simple/sll2n_insert_unequal.i [2023-11-19 04:48:02,164 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/data/29974ee3f/7c2ac73b49ea4e8988d330884086796f/FLAGeec259cde [2023-11-19 04:48:02,183 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/data/29974ee3f/7c2ac73b49ea4e8988d330884086796f [2023-11-19 04:48:02,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:48:02,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:48:02,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:48:02,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:48:02,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:48:02,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fc12c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02, skipping insertion in model container [2023-11-19 04:48:02,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,272 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:48:02,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:48:02,594 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:48:02,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:48:02,699 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:48:02,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02 WrapperNode [2023-11-19 04:48:02,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:48:02,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:48:02,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:48:02,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:48:02,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,802 INFO L138 Inliner]: procedures = 128, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 157 [2023-11-19 04:48:02,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:48:02,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:48:02,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:48:02,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:48:02,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:48:02,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:48:02,845 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:48:02,845 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:48:02,846 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (1/1) ... [2023-11-19 04:48:02,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:48:02,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:48:02,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:48:02,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:48:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 04:48:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:48:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 04:48:02,936 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 04:48:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 04:48:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:48:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:48:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 04:48:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 04:48:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:48:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 04:48:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:48:02,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:48:02,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:48:03,118 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:48:03,121 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:48:03,551 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:48:03,697 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:48:03,697 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-19 04:48:03,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:48:03 BoogieIcfgContainer [2023-11-19 04:48:03,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:48:03,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:48:03,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:48:03,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:48:03,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:48:02" (1/3) ... [2023-11-19 04:48:03,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377ce71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:48:03, skipping insertion in model container [2023-11-19 04:48:03,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:48:02" (2/3) ... [2023-11-19 04:48:03,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377ce71d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:48:03, skipping insertion in model container [2023-11-19 04:48:03,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:48:03" (3/3) ... [2023-11-19 04:48:03,737 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2023-11-19 04:48:03,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:48:03,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-19 04:48:03,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:48:03,827 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;@64a0bea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:48:03,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-11-19 04:48:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 80 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 04:48:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:48:03,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:03,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 04:48:03,839 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-19 04:48:03,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:03,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1932842508, now seen corresponding path program 1 times [2023-11-19 04:48:03,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:03,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988677810] [2023-11-19 04:48:03,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:03,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:04,243 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 04:48:04,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:04,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988677810] [2023-11-19 04:48:04,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988677810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:48:04,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:48:04,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:48:04,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989160056] [2023-11-19 04:48:04,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:48:04,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:48:04,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:04,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:48:04,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:48:04,313 INFO L87 Difference]: Start difference. First operand has 84 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 80 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.5) internal successors, (5), 3 states have internal predecessors, (5), 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 04:48:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:04,532 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2023-11-19 04:48:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:48:04,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-11-19 04:48:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:04,552 INFO L225 Difference]: With dead ends: 81 [2023-11-19 04:48:04,552 INFO L226 Difference]: Without dead ends: 79 [2023-11-19 04:48:04,555 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 04:48:04,561 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:04,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 109 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:48:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-19 04:48:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-11-19 04:48:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 75 states have internal predecessors, (84), 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 04:48:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2023-11-19 04:48:04,615 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 6 [2023-11-19 04:48:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:04,615 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2023-11-19 04:48:04,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 04:48:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2023-11-19 04:48:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 04:48:04,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:04,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 04:48:04,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:48:04,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-19 04:48:04,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:04,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1932842507, now seen corresponding path program 1 times [2023-11-19 04:48:04,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:04,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491620725] [2023-11-19 04:48:04,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:04,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:04,763 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 04:48:04,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:04,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491620725] [2023-11-19 04:48:04,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491620725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:48:04,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:48:04,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:48:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678115088] [2023-11-19 04:48:04,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:48:04,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:48:04,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:04,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:48:04,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:48:04,767 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 04:48:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:04,966 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-11-19 04:48:04,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:48:04,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-11-19 04:48:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:04,968 INFO L225 Difference]: With dead ends: 77 [2023-11-19 04:48:04,968 INFO L226 Difference]: Without dead ends: 77 [2023-11-19 04:48:04,969 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 04:48:04,971 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:04,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:48:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-19 04:48:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-19 04:48:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 73 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 04:48:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-11-19 04:48:04,983 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 6 [2023-11-19 04:48:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:04,983 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-11-19 04:48:04,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 04:48:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-11-19 04:48:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:48:04,985 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:04,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:04,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:48:04,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-19 04:48:04,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:04,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2127584166, now seen corresponding path program 1 times [2023-11-19 04:48:04,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:04,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045157147] [2023-11-19 04:48:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:05,153 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 04:48:05,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045157147] [2023-11-19 04:48:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045157147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:48:05,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:48:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:48:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910082693] [2023-11-19 04:48:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:48:05,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:48:05,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:05,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:48:05,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:48:05,158 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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 04:48:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:05,438 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2023-11-19 04:48:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:48:05,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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 04:48:05,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:05,446 INFO L225 Difference]: With dead ends: 78 [2023-11-19 04:48:05,447 INFO L226 Difference]: Without dead ends: 78 [2023-11-19 04:48:05,448 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 04:48:05,455 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 5 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:05,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 226 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:48:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-19 04:48:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-11-19 04:48:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 39 states have (on average 2.076923076923077) internal successors, (81), 72 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 04:48:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-19 04:48:05,474 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 10 [2023-11-19 04:48:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:05,475 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-19 04:48:05,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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 04:48:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-19 04:48:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:48:05,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:05,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:05,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:48:05,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-19 04:48:05,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:05,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2127584167, now seen corresponding path program 1 times [2023-11-19 04:48:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:05,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549493917] [2023-11-19 04:48:05,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:05,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:05,699 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 04:48:05,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549493917] [2023-11-19 04:48:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549493917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:48:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:48:05,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:48:05,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793932080] [2023-11-19 04:48:05,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:48:05,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:48:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:05,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:48:05,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:48:05,705 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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 04:48:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:05,907 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2023-11-19 04:48:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:48:05,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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 04:48:05,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:05,911 INFO L225 Difference]: With dead ends: 77 [2023-11-19 04:48:05,911 INFO L226 Difference]: Without dead ends: 77 [2023-11-19 04:48:05,912 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 04:48:05,922 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:05,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 238 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:48:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-19 04:48:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2023-11-19 04:48:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 39 states have (on average 2.051282051282051) internal successors, (80), 71 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 04:48:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-19 04:48:05,930 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2023-11-19 04:48:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:05,930 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-19 04:48:05,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 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 04:48:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-19 04:48:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:48:05,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:05,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:05,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:48:05,936 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-19 04:48:05,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash -970133642, now seen corresponding path program 1 times [2023-11-19 04:48:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:05,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715670554] [2023-11-19 04:48:05,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:05,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:06,056 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 04:48:06,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715670554] [2023-11-19 04:48:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715670554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:48:06,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:48:06,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:48:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764921517] [2023-11-19 04:48:06,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:48:06,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:48:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:06,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:48:06,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:48:06,059 INFO L87 Difference]: Start difference. First operand 75 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 04:48:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:06,101 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2023-11-19 04:48:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:48:06,102 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 04:48:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:06,103 INFO L225 Difference]: With dead ends: 79 [2023-11-19 04:48:06,103 INFO L226 Difference]: Without dead ends: 79 [2023-11-19 04:48:06,103 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 04:48:06,104 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:06,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 132 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:48:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-19 04:48:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2023-11-19 04:48:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 40 states have (on average 2.025) internal successors, (81), 72 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 04:48:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-11-19 04:48:06,127 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 10 [2023-11-19 04:48:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:06,127 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-11-19 04:48:06,127 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 04:48:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-11-19 04:48:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 04:48:06,129 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:06,129 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:06,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:48:06,130 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-19 04:48:06,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1416573081, now seen corresponding path program 1 times [2023-11-19 04:48:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:06,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740000835] [2023-11-19 04:48:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:06,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:06,242 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 04:48:06,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:06,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740000835] [2023-11-19 04:48:06,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740000835] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:06,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614313494] [2023-11-19 04:48:06,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:06,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:06,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:48:06,247 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:48:06,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 04:48:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:06,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:48:06,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:48:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:48:06,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:48:06,523 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 04:48:06,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614313494] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 04:48:06,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [893077154] [2023-11-19 04:48:06,552 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:48:06,553 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:48:06,559 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:48:06,565 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:48:06,566 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:48:09,427 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-11-19 04:48:09,525 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:48:14,114 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1000#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= 2 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_sll_insert_#in~data#1| 5) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (or (and (exists ((|v_#valid_96| (Array Int Int))) (and (= |#valid| (store |v_#valid_96| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1)) (= (select |v_#valid_96| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#length_81| (Array Int Int))) (= |#length| (store |v_#length_81| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))) (= (store |v_#memory_int_50| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_51|))) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_21| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_12| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_12| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|)) (and (exists ((|v_#valid_96| (Array Int Int))) (and (= |#valid| (store |v_#valid_96| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1)) (= (select |v_#valid_96| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_73| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#length_81| (Array Int Int))) (= |#length| (store |v_#length_81| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_73| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_73| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))) (= (store |v_#memory_int_50| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_51|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_11| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_11| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_11| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|))) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)))' at error location [2023-11-19 04:48:14,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:48:14,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 04:48:14,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-19 04:48:14,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523824134] [2023-11-19 04:48:14,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 04:48:14,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:48:14,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:14,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:48:14,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-19 04:48:14,117 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 04:48:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:14,223 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2023-11-19 04:48:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:48:14,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-19 04:48:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:14,226 INFO L225 Difference]: With dead ends: 80 [2023-11-19 04:48:14,226 INFO L226 Difference]: Without dead ends: 80 [2023-11-19 04:48:14,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-11-19 04:48:14,227 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:14,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 196 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:48:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-19 04:48:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-19 04:48:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.9534883720930232) internal successors, (84), 75 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:48:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2023-11-19 04:48:14,241 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2023-11-19 04:48:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:14,242 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2023-11-19 04:48:14,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 04:48:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2023-11-19 04:48:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-19 04:48:14,244 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:14,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:14,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:48:14,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:14,452 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-19 04:48:14,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:14,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1137670442, now seen corresponding path program 2 times [2023-11-19 04:48:14,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:14,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453059564] [2023-11-19 04:48:14,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:14,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:48:15,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453059564] [2023-11-19 04:48:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453059564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724727533] [2023-11-19 04:48:15,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:48:15,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:15,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:48:15,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:48:15,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 04:48:15,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 04:48:15,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:48:15,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-19 04:48:15,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:48:15,642 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 04:48:15,666 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 04:48:15,677 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-19 04:48:15,733 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 04:48:15,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-19 04:48:15,789 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 04:48:15,844 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 04:48:15,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-19 04:48:15,941 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 04:48:15,961 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-19 04:48:16,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:48:16,009 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 04:48:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 8 not checked. [2023-11-19 04:48:16,020 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:48:16,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724727533] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:16,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [732978050] [2023-11-19 04:48:16,161 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-19 04:48:16,162 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:48:16,162 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:48:16,162 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:48:16,162 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:48:18,167 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-11-19 04:48:18,258 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:48:24,106 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1279#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= 2 |ULTIMATE.start_sll_insert_#in~head#1.base|) (= |ULTIMATE.start_sll_insert_#in~data#1| 5) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1)) (or (and (exists ((|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_24| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_24| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))) (= (store |v_#memory_int_62| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_63|))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_88| (Array Int Int))) (= (store |v_#length_88| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#valid_109| (Array Int Int))) (and (= (select |v_#valid_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_24| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_24| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|)) (and (exists ((|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_62| (Array Int (Array Int Int))) (|v_#memory_int_63| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))) (= (store |v_#memory_int_62| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_62| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_63| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_63|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_25| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_25| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_88| (Array Int Int))) (= (store |v_#length_88| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_85| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (exists ((|v_#valid_109| (Array Int Int))) (and (= (select |v_#valid_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_109| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_25| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_25| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))))' at error location [2023-11-19 04:48:24,106 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:48:24,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:48:24,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 14 [2023-11-19 04:48:24,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851930297] [2023-11-19 04:48:24,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:48:24,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-19 04:48:24,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:24,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-19 04:48:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=607, Unknown=2, NotChecked=102, Total=812 [2023-11-19 04:48:24,110 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 16 states, 11 states have (on average 2.727272727272727) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-19 04:48:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:24,922 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2023-11-19 04:48:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:48:24,923 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 2.727272727272727) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2023-11-19 04:48:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:24,924 INFO L225 Difference]: With dead ends: 86 [2023-11-19 04:48:24,924 INFO L226 Difference]: Without dead ends: 86 [2023-11-19 04:48:24,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=120, Invalid=698, Unknown=2, NotChecked=110, Total=930 [2023-11-19 04:48:24,926 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 168 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:24,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 194 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 174 Unchecked, 0.6s Time] [2023-11-19 04:48:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-19 04:48:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2023-11-19 04:48:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 71 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 04:48:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2023-11-19 04:48:24,933 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 28 [2023-11-19 04:48:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:24,933 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2023-11-19 04:48:24,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 2.727272727272727) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-19 04:48:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2023-11-19 04:48:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-19 04:48:24,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:24,935 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:24,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:48:25,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:25,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-19 04:48:25,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1137670441, now seen corresponding path program 1 times [2023-11-19 04:48:25,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:25,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535606339] [2023-11-19 04:48:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-19 04:48:26,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:26,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535606339] [2023-11-19 04:48:26,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535606339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:26,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154677008] [2023-11-19 04:48:26,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:26,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:26,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:48:26,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:48:26,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 04:48:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:26,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-19 04:48:26,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:48:26,461 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 04:48:26,527 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 04:48:26,543 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 04:48:26,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:48:26,583 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 04:48:26,631 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 04:48:26,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:48:26,695 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 04:48:26,793 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 04:48:26,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:48:26,851 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 04:48:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-19 04:48:26,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:48:26,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154677008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:48:26,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 04:48:26,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-11-19 04:48:26,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991498309] [2023-11-19 04:48:26,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:48:26,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:48:26,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:26,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:48:26,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2023-11-19 04:48:26,894 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 04:48:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:27,189 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-11-19 04:48:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:48:27,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-19 04:48:27,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:27,191 INFO L225 Difference]: With dead ends: 74 [2023-11-19 04:48:27,191 INFO L226 Difference]: Without dead ends: 74 [2023-11-19 04:48:27,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=192, Unknown=1, NotChecked=28, Total=272 [2023-11-19 04:48:27,192 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:27,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 187 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2023-11-19 04:48:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-19 04:48:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-19 04:48:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.813953488372093) internal successors, (78), 69 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 04:48:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2023-11-19 04:48:27,199 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 28 [2023-11-19 04:48:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:27,199 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2023-11-19 04:48:27,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 04:48:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2023-11-19 04:48:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 04:48:27,201 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:27,201 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:27,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:48:27,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:27,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-19 04:48:27,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1915535143, now seen corresponding path program 1 times [2023-11-19 04:48:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:27,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855341156] [2023-11-19 04:48:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 04:48:28,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:28,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855341156] [2023-11-19 04:48:28,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855341156] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:28,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901198153] [2023-11-19 04:48:28,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:28,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:28,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:48:28,288 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:48:28,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 04:48:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:28,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-19 04:48:28,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:48:28,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-19 04:48:29,232 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-19 04:48:29,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:48:29,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-19 04:48:29,306 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-19 04:48:29,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-19 04:48:29,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 04:48:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2023-11-19 04:48:29,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:48:29,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901198153] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:29,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [649682748] [2023-11-19 04:48:29,625 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 04:48:29,625 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:48:29,625 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:48:29,626 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:48:29,626 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:48:31,507 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-11-19 04:48:31,576 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-19 04:48:39,617 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1832#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_insert_~last~0#1.offset|) (= |ULTIMATE.start_sll_insert_#in~index#1| 1) (or (and (exists ((|v_#length_99| (Array Int Int))) (= |#length| (store |v_#length_99| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_38| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.base_101| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_74| (Array Int (Array Int Int))) (|v_#memory_int_75| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_74| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_74| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_75|) (= |#memory_int| (store |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_119| (Array Int Int))) (and (= (store |v_#valid_119| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_119| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_38| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_38| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_60| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_99| (Array Int Int))) (= |#length| (store |v_#length_99| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_97| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_97| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (exists ((|v_#memory_$Pointer$.base_101| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_101| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_74| (Array Int (Array Int Int))) (|v_#memory_int_75| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_74| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_74| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4 (select (select |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 4))) |v_#memory_int_75|) (= |#memory_int| (store |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |v_#memory_int_75| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0 5))))) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_119| (Array Int Int))) (and (= (store |v_#valid_119| |ULTIMATE.start_sll_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_119| |ULTIMATE.start_sll_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_insert_#in~head#1.base| |ULTIMATE.start_sll_insert_~head#1.base|))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_insert_~data#1|) (= |ULTIMATE.start_sll_insert_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_insert_~head#1.base|)) (= |ULTIMATE.start_sll_insert_#in~data#1| 5) (not (= (select |#valid| |ULTIMATE.start_sll_insert_~last~0#1.base|) 1)) (= |ULTIMATE.start_sll_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_insert_~head#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_insert_~index#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_insert_~head#1.base|) 0) |ULTIMATE.start_sll_insert_~last~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) 0) |ULTIMATE.start_sll_insert_~last~0#1.base|) (<= 2 |ULTIMATE.start_sll_insert_~head#1.base|) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_insert_~last~0#1.base|))' at error location [2023-11-19 04:48:39,617 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-19 04:48:39,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 04:48:39,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2023-11-19 04:48:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953384632] [2023-11-19 04:48:39,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 04:48:39,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-19 04:48:39,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:48:39,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 04:48:39,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1358, Unknown=2, NotChecked=74, Total=1560 [2023-11-19 04:48:39,620 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 25 states, 18 states have (on average 2.111111111111111) internal successors, (38), 22 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 04:48:41,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:48:41,773 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2023-11-19 04:48:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 04:48:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 2.111111111111111) internal successors, (38), 22 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-11-19 04:48:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:48:41,775 INFO L225 Difference]: With dead ends: 85 [2023-11-19 04:48:41,775 INFO L226 Difference]: Without dead ends: 85 [2023-11-19 04:48:41,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=215, Invalid=2139, Unknown=2, NotChecked=94, Total=2450 [2023-11-19 04:48:41,778 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 112 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-19 04:48:41,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 678 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 942 Invalid, 0 Unknown, 95 Unchecked, 1.5s Time] [2023-11-19 04:48:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-19 04:48:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2023-11-19 04:48:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 71 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 04:48:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2023-11-19 04:48:41,784 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 30 [2023-11-19 04:48:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:48:41,785 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2023-11-19 04:48:41,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 2.111111111111111) internal successors, (38), 22 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 04:48:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2023-11-19 04:48:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-19 04:48:41,787 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:48:41,787 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:48:41,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-19 04:48:42,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:42,012 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-19 04:48:42,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:48:42,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1915535144, now seen corresponding path program 1 times [2023-11-19 04:48:42,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:48:42,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680715965] [2023-11-19 04:48:42,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:42,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:48:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 04:48:43,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:48:43,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680715965] [2023-11-19 04:48:43,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680715965] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:43,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403869280] [2023-11-19 04:48:43,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:48:43,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 04:48:43,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:48:43,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 04:48:43,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0b06a8e-1bf4-4f70-a98b-aad4417d83e3/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 04:48:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:48:43,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-19 04:48:43,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:48:43,928 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 04:48:44,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-19 04:48:44,475 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 04:48:44,801 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-19 04:48:44,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:48:44,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-19 04:48:44,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:48:44,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-19 04:48:44,866 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-19 04:48:44,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-19 04:48:44,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 04:48:44,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 04:48:44,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 04:48:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-11-19 04:48:45,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 04:48:45,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403869280] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 04:48:45,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [590654607] [2023-11-19 04:48:45,831 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-19 04:48:45,832 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 04:48:45,832 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-19 04:48:45,832 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-19 04:48:45,833 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-19 04:48:47,646 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 97 for LOIs [2023-11-19 04:48:48,124 INFO L180 IcfgInterpreter]: Interpretation finished