./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:04:29,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:04:29,591 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-25 00:04:29,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:04:29,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:04:29,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:04:29,645 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:04:29,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:04:29,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:04:29,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:04:29,654 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:04:29,655 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:04:29,656 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:04:29,658 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:04:29,658 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:04:29,659 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:04:29,659 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:04:29,660 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:04:29,660 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:04:29,660 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:04:29,661 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:04:29,662 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:04:29,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-25 00:04:29,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-25 00:04:29,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:04:29,664 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:04:29,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:04:29,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:04:29,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:04:29,666 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-25 00:04:29,667 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-25 00:04:29,667 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-25 00:04:29,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:04:29,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-25 00:04:29,668 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-25 00:04:29,668 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:04:29,668 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:04:29,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:04:29,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:04:29,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:04:29,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:04:29,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:04:29,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:04:29,670 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:04:29,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:04:29,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:04:29,672 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:04:29,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:04:29,672 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_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-11-25 00:04:29,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:04:29,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:04:29,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:04:29,986 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:04:29,987 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:04:29,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-25 00:04:33,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:04:33,485 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:04:33,486 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-11-25 00:04:33,512 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/data/c173a900a/13b34862c78f4e4aa724d94f0cb6097e/FLAG9d87188ab [2023-11-25 00:04:33,529 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/data/c173a900a/13b34862c78f4e4aa724d94f0cb6097e [2023-11-25 00:04:33,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:04:33,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:04:33,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:04:33,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:04:33,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:04:33,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:04:33" (1/1) ... [2023-11-25 00:04:33,548 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9aa0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:33, skipping insertion in model container [2023-11-25 00:04:33,548 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:04:33" (1/1) ... [2023-11-25 00:04:33,607 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:04:33,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:04:33,956 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:04:34,030 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:04:34,064 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:04:34,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34 WrapperNode [2023-11-25 00:04:34,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:04:34,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:04:34,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:04:34,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:04:34,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,130 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 183 [2023-11-25 00:04:34,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:04:34,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:04:34,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:04:34,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:04:34,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,180 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:04:34,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:04:34,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:04:34,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:04:34,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (1/1) ... [2023-11-25 00:04:34,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:04:34,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:04:34,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:04:34,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:04:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:04:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:04:34,296 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-25 00:04:34,296 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-25 00:04:34,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:04:34,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:04:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:04:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-25 00:04:34,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-25 00:04:34,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:04:34,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-25 00:04:34,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:04:34,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:04:34,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:04:34,460 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:04:34,463 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:04:34,950 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:04:35,067 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:04:35,068 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-25 00:04:35,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:04:35 BoogieIcfgContainer [2023-11-25 00:04:35,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:04:35,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:04:35,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:04:35,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:04:35,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:04:33" (1/3) ... [2023-11-25 00:04:35,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef811ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:04:35, skipping insertion in model container [2023-11-25 00:04:35,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:34" (2/3) ... [2023-11-25 00:04:35,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef811ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:04:35, skipping insertion in model container [2023-11-25 00:04:35,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:04:35" (3/3) ... [2023-11-25 00:04:35,084 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-11-25 00:04:35,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:04:35,101 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-11-25 00:04:35,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:04:35,152 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;@5845229b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:04:35,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-11-25 00:04:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 59 states have (on average 2.3220338983050848) internal successors, (137), 121 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:04:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-25 00:04:35,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:35,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-25 00:04:35,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:04:35,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:35,172 INFO L85 PathProgramCache]: Analyzing trace with hash 278979000, now seen corresponding path program 1 times [2023-11-25 00:04:35,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:35,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576000245] [2023-11-25 00:04:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:04:35,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:35,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576000245] [2023-11-25 00:04:35,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576000245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:35,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:35,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:04:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898540642] [2023-11-25 00:04:35,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:35,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:35,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:35,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:35,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:35,576 INFO L87 Difference]: Start difference. First operand has 126 states, 59 states have (on average 2.3220338983050848) internal successors, (137), 121 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:35,811 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2023-11-25 00:04:35,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-25 00:04:35,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:35,826 INFO L225 Difference]: With dead ends: 123 [2023-11-25 00:04:35,827 INFO L226 Difference]: Without dead ends: 121 [2023-11-25 00:04:35,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:35,836 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 6 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:35,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:04:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-25 00:04:35,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-25 00:04:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 57 states have (on average 2.2280701754385963) internal successors, (127), 116 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:04:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2023-11-25 00:04:35,902 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 5 [2023-11-25 00:04:35,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:35,903 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2023-11-25 00:04:35,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2023-11-25 00:04:35,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-25 00:04:35,904 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:35,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-25 00:04:35,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:04:35,906 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:04:35,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:35,907 INFO L85 PathProgramCache]: Analyzing trace with hash 278979001, now seen corresponding path program 1 times [2023-11-25 00:04:35,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:35,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479339534] [2023-11-25 00:04:35,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:35,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:04:36,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479339534] [2023-11-25 00:04:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479339534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:36,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:04:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331850196] [2023-11-25 00:04:36,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:36,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:36,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:36,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:36,075 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:36,225 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-11-25 00:04:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:36,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-25 00:04:36,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:36,229 INFO L225 Difference]: With dead ends: 119 [2023-11-25 00:04:36,231 INFO L226 Difference]: Without dead ends: 119 [2023-11-25 00:04:36,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:36,233 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:36,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 181 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:04:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-25 00:04:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-25 00:04:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 57 states have (on average 2.192982456140351) internal successors, (125), 114 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:04:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-11-25 00:04:36,253 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 5 [2023-11-25 00:04:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:36,253 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-11-25 00:04:36,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-11-25 00:04:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-25 00:04:36,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:36,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:36,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:04:36,256 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:04:36,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1927405842, now seen corresponding path program 1 times [2023-11-25 00:04:36,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:36,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66590628] [2023-11-25 00:04:36,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:36,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:04:36,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:36,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66590628] [2023-11-25 00:04:36,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66590628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:36,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:36,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:04:36,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899202537] [2023-11-25 00:04:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:36,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:36,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:36,366 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:04:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:36,425 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2023-11-25 00:04:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:36,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-25 00:04:36,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:36,430 INFO L225 Difference]: With dead ends: 125 [2023-11-25 00:04:36,430 INFO L226 Difference]: Without dead ends: 125 [2023-11-25 00:04:36,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:36,442 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 4 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:36,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 222 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:04:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-25 00:04:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 120. [2023-11-25 00:04:36,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 58 states have (on average 2.1724137931034484) internal successors, (126), 115 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:04:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2023-11-25 00:04:36,457 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 10 [2023-11-25 00:04:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:36,458 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2023-11-25 00:04:36,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:04:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2023-11-25 00:04:36,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-25 00:04:36,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:36,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:36,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-25 00:04:36,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:04:36,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607865, now seen corresponding path program 1 times [2023-11-25 00:04:36,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:36,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939253638] [2023-11-25 00:04:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:36,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:04:36,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:36,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939253638] [2023-11-25 00:04:36,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939253638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:36,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:36,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:04:36,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982890544] [2023-11-25 00:04:36,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:36,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:04:36,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:36,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:04:36,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:04:36,605 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:04:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:36,847 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2023-11-25 00:04:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:04:36,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-25 00:04:36,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:36,849 INFO L225 Difference]: With dead ends: 119 [2023-11-25 00:04:36,849 INFO L226 Difference]: Without dead ends: 119 [2023-11-25 00:04:36,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:04:36,851 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:36,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 356 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:04:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-25 00:04:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-25 00:04:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 58 states have (on average 2.1551724137931036) internal successors, (125), 114 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:04:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2023-11-25 00:04:36,861 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 17 [2023-11-25 00:04:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:36,861 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2023-11-25 00:04:36,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:04:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2023-11-25 00:04:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-25 00:04:36,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:36,863 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:36,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-25 00:04:36,863 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:04:36,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:36,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1053607864, now seen corresponding path program 1 times [2023-11-25 00:04:36,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:36,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129544991] [2023-11-25 00:04:36,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:36,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:04:37,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:37,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129544991] [2023-11-25 00:04:37,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129544991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:37,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:37,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:04:37,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118272137] [2023-11-25 00:04:37,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:37,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:04:37,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:04:37,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:04:37,187 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:04:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:37,447 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2023-11-25 00:04:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:04:37,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-11-25 00:04:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:37,448 INFO L225 Difference]: With dead ends: 118 [2023-11-25 00:04:37,449 INFO L226 Difference]: Without dead ends: 118 [2023-11-25 00:04:37,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:04:37,451 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:37,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:04:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-25 00:04:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-11-25 00:04:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 58 states have (on average 2.1379310344827585) internal successors, (124), 113 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:04:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2023-11-25 00:04:37,468 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 17 [2023-11-25 00:04:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:37,468 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2023-11-25 00:04:37,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-25 00:04:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2023-11-25 00:04:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-25 00:04:37,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:37,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:37,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-25 00:04:37,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:04:37,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1095361633, now seen corresponding path program 1 times [2023-11-25 00:04:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:37,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98456795] [2023-11-25 00:04:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:37,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:04:37,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:37,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98456795] [2023-11-25 00:04:37,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98456795] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:04:37,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534537300] [2023-11-25 00:04:37,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:37,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:04:37,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:04:37,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:04:37,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:04:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:38,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-25 00:04:38,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:38,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:04:38,134 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-25 00:04:38,202 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-25 00:04:38,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-25 00:04:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-25 00:04:38,224 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:04:38,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534537300] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:04:38,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1183272285] [2023-11-25 00:04:38,324 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-25 00:04:38,325 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:04:38,330 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:04:38,336 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:04:38,337 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:04:39,966 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-25 00:04:40,135 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:04:42,970 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1436#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-25 00:04:42,970 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:04:42,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:04:42,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2023-11-25 00:04:42,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259320010] [2023-11-25 00:04:42,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:04:42,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-25 00:04:42,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:42,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-25 00:04:42,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=433, Unknown=1, NotChecked=42, Total=552 [2023-11-25 00:04:42,972 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:04:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:43,377 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2023-11-25 00:04:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:04:43,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-11-25 00:04:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:43,379 INFO L225 Difference]: With dead ends: 117 [2023-11-25 00:04:43,379 INFO L226 Difference]: Without dead ends: 117 [2023-11-25 00:04:43,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=94, Invalid=509, Unknown=1, NotChecked=46, Total=650 [2023-11-25 00:04:43,381 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 5 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:43,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 458 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 415 Invalid, 0 Unknown, 124 Unchecked, 0.3s Time] [2023-11-25 00:04:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-25 00:04:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-11-25 00:04:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 58 states have (on average 2.1206896551724137) internal successors, (123), 112 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:04:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 129 transitions. [2023-11-25 00:04:43,389 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 129 transitions. Word has length 19 [2023-11-25 00:04:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:43,389 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 129 transitions. [2023-11-25 00:04:43,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-25 00:04:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 129 transitions. [2023-11-25 00:04:43,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-25 00:04:43,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:43,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:43,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-25 00:04:43,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:04:43,597 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:04:43,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:43,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1095361634, now seen corresponding path program 1 times [2023-11-25 00:04:43,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:43,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203469637] [2023-11-25 00:04:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:43,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:04:43,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203469637] [2023-11-25 00:04:43,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203469637] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:04:43,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240266628] [2023-11-25 00:04:43,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:43,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:04:43,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:04:43,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:04:43,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:04:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:44,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-25 00:04:44,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:44,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:04:44,340 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-25 00:04:44,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-25 00:04:44,361 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:04:44,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-25 00:04:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:04:44,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:04:44,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240266628] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:04:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1035478328] [2023-11-25 00:04:44,609 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-25 00:04:44,609 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:04:44,610 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:04:44,610 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:04:44,610 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:04:45,624 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-11-25 00:04:45,731 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:04:48,654 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1775#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-11-25 00:04:48,655 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:04:48,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:04:48,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-25 00:04:48,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222468760] [2023-11-25 00:04:48,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:04:48,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-25 00:04:48,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:48,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-25 00:04:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=887, Unknown=1, NotChecked=0, Total=992 [2023-11-25 00:04:48,658 INFO L87 Difference]: Start difference. First operand 117 states and 129 transitions. Second operand has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-25 00:04:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:49,725 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2023-11-25 00:04:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-25 00:04:49,725 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-25 00:04:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:49,727 INFO L225 Difference]: With dead ends: 118 [2023-11-25 00:04:49,727 INFO L226 Difference]: Without dead ends: 118 [2023-11-25 00:04:49,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=144, Invalid=1187, Unknown=1, NotChecked=0, Total=1332 [2023-11-25 00:04:49,729 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:49,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 943 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-25 00:04:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-25 00:04:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2023-11-25 00:04:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 58 states have (on average 2.103448275862069) internal successors, (122), 111 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:04:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2023-11-25 00:04:49,743 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 19 [2023-11-25 00:04:49,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:49,744 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2023-11-25 00:04:49,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-25 00:04:49,744 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2023-11-25 00:04:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-25 00:04:49,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:49,746 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:49,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:04:49,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:04:49,953 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:04:49,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1055866954, now seen corresponding path program 1 times [2023-11-25 00:04:49,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:49,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480686900] [2023-11-25 00:04:49,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:49,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:04:50,477 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480686900] [2023-11-25 00:04:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480686900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:04:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916357105] [2023-11-25 00:04:50,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:50,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:04:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:04:50,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:04:50,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:04:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:50,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-25 00:04:50,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:50,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:04:50,693 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-25 00:04:50,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-25 00:04:50,765 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-25 00:04:50,766 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 18 treesize of output 17 [2023-11-25 00:04:50,905 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-25 00:04:50,923 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-25 00:04:50,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-25 00:04:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2023-11-25 00:04:50,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:04:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:04:51,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916357105] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:04:51,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1585885710] [2023-11-25 00:04:51,742 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-25 00:04:51,742 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:04:51,742 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:04:51,742 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:04:51,743 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:04:52,916 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-25 00:04:52,940 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:04:57,829 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2215#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (or (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_159| (Array Int Int))) (and (= (store |v_#valid_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_31| (Array Int Int)) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_52| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_31| (Array Int Int)) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_31| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= (select |v_old(#valid)_AFTER_CALL_31| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (= (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_#memory_int_BEFORE_CALL_52| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0))) |v_#memory_int_BEFORE_CALL_52|) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (exists ((|v_#memory_$Pointer$.offset_129| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))) (= (store |v_#memory_int_100| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_100| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_101|))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_131| (Array Int Int))) (= (store |v_#length_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8) |#length|))) (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_129| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_159| (Array Int Int))) (and (= (store |v_#valid_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|) (= (select |v_#valid_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_30| (Array Int Int)) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_30| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_30| (Array Int Int)) (|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= |v_old(#memory_int)_AFTER_CALL_30| (store |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_104| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))) (= 1 (select |v_old(#valid)_AFTER_CALL_30| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_133| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (exists ((|v_#memory_$Pointer$.offset_129| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_129| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_int_100| (Array Int (Array Int Int))) (|v_#memory_int_101| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))) (= (store |v_#memory_int_100| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_100| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_101| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_101|))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_131| (Array Int Int))) (= (store |v_#length_131| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8) |#length|)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1)) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5))' at error location [2023-11-25 00:04:57,829 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:04:57,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:04:57,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 26 [2023-11-25 00:04:57,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795643301] [2023-11-25 00:04:57,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:04:57,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-25 00:04:57,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:57,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-25 00:04:57,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1534, Unknown=6, NotChecked=80, Total=1806 [2023-11-25 00:04:57,834 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-25 00:04:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:58,621 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2023-11-25 00:04:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:04:58,621 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2023-11-25 00:04:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:58,623 INFO L225 Difference]: With dead ends: 124 [2023-11-25 00:04:58,623 INFO L226 Difference]: Without dead ends: 124 [2023-11-25 00:04:58,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=229, Invalid=1749, Unknown=6, NotChecked=86, Total=2070 [2023-11-25 00:04:58,625 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 337 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:58,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 409 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 599 Invalid, 0 Unknown, 132 Unchecked, 0.6s Time] [2023-11-25 00:04:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-25 00:04:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2023-11-25 00:04:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 102 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:04:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2023-11-25 00:04:58,630 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 27 [2023-11-25 00:04:58,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:58,631 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2023-11-25 00:04:58,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.380952380952381) internal successors, (50), 23 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-25 00:04:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2023-11-25 00:04:58,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-25 00:04:58,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:58,632 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:58,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:04:58,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:04:58,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:04:58,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1055866955, now seen corresponding path program 1 times [2023-11-25 00:04:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:58,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221741520] [2023-11-25 00:04:58,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:58,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:04:59,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221741520] [2023-11-25 00:04:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221741520] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:04:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094270309] [2023-11-25 00:04:59,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:59,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:04:59,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:04:59,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:04:59,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-25 00:04:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:59,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-25 00:04:59,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:59,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-25 00:04:59,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-25 00:05:00,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:05:00,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-25 00:05:00,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-25 00:05:00,203 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-25 00:05:00,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-25 00:05:00,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:05:00,534 INFO L349 Elim1Store]: treesize reduction 12, result has 86.5 percent of original size [2023-11-25 00:05:00,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 172 treesize of output 203 [2023-11-25 00:05:00,675 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 23 treesize of output 19 [2023-11-25 00:05:00,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-25 00:05:00,685 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 6 treesize of output 4 [2023-11-25 00:05:00,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-25 00:05:00,733 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-11-25 00:05:00,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:05:00,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-25 00:05:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2023-11-25 00:05:00,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:05:00,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094270309] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:05:00,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2116157249] [2023-11-25 00:05:00,931 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-25 00:05:00,931 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:05:00,931 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:05:00,931 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:05:00,931 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:05:02,081 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-25 00:05:02,102 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:05:07,095 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2581#(and (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (<= (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 3) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| 0) (or (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (exists ((|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))) (= (store |v_#memory_int_112| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_112| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_113|))) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_166| (Array Int Int))) (and (= (select |v_#valid_166| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_166| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_old(#valid)_AFTER_CALL_44| (Array Int Int)) (|v_old(#length)_AFTER_CALL_44| (Array Int Int)) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_44| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_44| (store |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_44| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))) (= (select |v_old(#valid)_AFTER_CALL_44| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (<= 4 (select |v_old(#length)_AFTER_CALL_44| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select (select (store |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select (store |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#length_144| (Array Int Int))) (= |#length| (store |v_#length_144| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (and (exists ((|v_old(#length)_AFTER_CALL_43| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_43| (Array Int Int)) (|v_#memory_int_116| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_145| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_116| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_#memory_int_BEFORE_CALL_73| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0))) |v_#memory_int_BEFORE_CALL_73|) (= (select (select (store |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select (store |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_145| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_43| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select |v_old(#valid)_AFTER_CALL_43| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1))) (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (exists ((|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))) (= (store |v_#memory_int_112| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_112| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_113| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_113|))) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_166| (Array Int Int))) (and (= (select |v_#valid_166| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= (store |v_#valid_166| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#valid|))) (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_143| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_141| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#length_144| (Array Int Int))) (= |#length| (store |v_#length_144| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5))' at error location [2023-11-25 00:05:07,095 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:05:07,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:05:07,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2023-11-25 00:05:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798931745] [2023-11-25 00:05:07,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:05:07,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-25 00:05:07,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:05:07,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-25 00:05:07,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1509, Unknown=13, NotChecked=78, Total=1722 [2023-11-25 00:05:07,099 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 25 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-25 00:05:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:05:08,935 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2023-11-25 00:05:08,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-25 00:05:08,941 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2023-11-25 00:05:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:05:08,947 INFO L225 Difference]: With dead ends: 121 [2023-11-25 00:05:08,947 INFO L226 Difference]: Without dead ends: 121 [2023-11-25 00:05:08,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=200, Invalid=2239, Unknown=15, NotChecked=96, Total=2550 [2023-11-25 00:05:08,951 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 249 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:05:08,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 506 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1223 Invalid, 0 Unknown, 133 Unchecked, 1.2s Time] [2023-11-25 00:05:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-25 00:05:08,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 98. [2023-11-25 00:05:08,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.793103448275862) internal successors, (104), 93 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:05:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2023-11-25 00:05:08,961 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 27 [2023-11-25 00:05:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:05:08,963 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2023-11-25 00:05:08,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 20 states have internal predecessors, (40), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-25 00:05:08,964 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2023-11-25 00:05:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-25 00:05:08,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:05:08,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:05:08,979 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-25 00:05:09,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:05:09,174 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:05:09,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:05:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1076082385, now seen corresponding path program 1 times [2023-11-25 00:05:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:05:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740668900] [2023-11-25 00:05:09,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:05:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-25 00:05:09,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:05:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740668900] [2023-11-25 00:05:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740668900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:05:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155458279] [2023-11-25 00:05:09,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:05:09,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:05:09,901 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:05:09,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-25 00:05:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:10,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-25 00:05:10,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:05:10,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:05:10,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-11-25 00:05:10,437 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-25 00:05:10,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:05:10,451 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-25 00:05:10,475 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-25 00:05:10,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-25 00:05:10,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-25 00:05:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-25 00:05:10,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:05:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155458279] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:05:10,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [129320429] [2023-11-25 00:05:10,684 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-25 00:05:10,684 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:05:10,684 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:05:10,684 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:05:10,684 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:05:11,950 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 8 for LOIs [2023-11-25 00:05:11,973 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:05:18,917 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2957#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~mid_index~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 1) (= |ULTIMATE.start_sll_circular_insert_#in~index#1| 1) (= |ULTIMATE.start_sll_circular_insert_~index#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_circular_insert_~data#1|) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_insert_~head#1.base|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) (= |ULTIMATE.start_sll_circular_insert_~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_circular_insert_~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) 1)) (or (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_153| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.base_163| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|v_#length_BEFORE_CALL_109| (Array Int Int)) (|v_#memory_$Pointer$.offset_157| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.base_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (= (select (select (store |v_#memory_$Pointer$.offset_157| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_157| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_109| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)) (= (select |v_old(#valid)_AFTER_CALL_58| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1))) (exists ((|v_#length_151| (Array Int Int))) (= |#length| (store |v_#length_151| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.base_159| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_124| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_124| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_125|) (= |#memory_int| (store |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_177| (Array Int Int))) (and (= (select |v_#valid_177| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= |#valid| (store |v_#valid_177| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1))))) (and (not (= |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 0)) (<= (+ |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_153| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_153| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))))) (exists ((|v_#length_151| (Array Int Int))) (= |#length| (store |v_#length_151| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 8))) (= |ULTIMATE.start_sll_circular_insert_~head#1.base| |ULTIMATE.start_sll_circular_insert_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.base_159| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (store (select |v_#memory_$Pointer$.base_159| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.base_163| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_59| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| Int) (|v_#length_BEFORE_CALL_111| (Array Int Int)) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_59| (Array Int Int)) (|v_#memory_$Pointer$.offset_157| (Array Int (Array Int Int)))) (and (= (select |v_old(#valid)_AFTER_CALL_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 1) (= (select (select (store |v_#memory_$Pointer$.base_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.base_163| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= (select (select (store |v_#memory_$Pointer$.offset_157| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_$Pointer$.offset_157| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= |v_old(#memory_int)_AFTER_CALL_59| (store |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20| (store (select |v_#memory_int_128| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|) 0)))) (<= 4 (select |v_#length_BEFORE_CALL_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_20|)))) (exists ((|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_124| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_124| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0 (select (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0))) |v_#memory_int_125|) (= |#memory_int| (store |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |v_#memory_int_125| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 4 5))))) (= |ULTIMATE.start_sll_circular_insert_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_177| (Array Int Int))) (and (= (select |v_#valid_177| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) 0) (= |#valid| (store |v_#valid_177| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| 1)))))) (= |ULTIMATE.start_sll_circular_insert_#in~data#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~head#1.base|) 0)))' at error location [2023-11-25 00:05:18,917 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:05:18,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-25 00:05:18,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-11-25 00:05:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770717433] [2023-11-25 00:05:18,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-25 00:05:18,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-25 00:05:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:05:18,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-25 00:05:18,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1506, Unknown=10, NotChecked=78, Total=1722 [2023-11-25 00:05:18,921 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 21 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:05:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:05:20,052 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2023-11-25 00:05:20,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-25 00:05:20,052 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 21 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2023-11-25 00:05:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:05:20,054 INFO L225 Difference]: With dead ends: 128 [2023-11-25 00:05:20,054 INFO L226 Difference]: Without dead ends: 128 [2023-11-25 00:05:20,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=193, Invalid=2153, Unknown=10, NotChecked=94, Total=2450 [2023-11-25 00:05:20,055 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 375 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-25 00:05:20,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 587 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 847 Invalid, 0 Unknown, 143 Unchecked, 0.7s Time] [2023-11-25 00:05:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-25 00:05:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100. [2023-11-25 00:05:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.8) internal successors, (108), 95 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-25 00:05:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2023-11-25 00:05:20,060 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 29 [2023-11-25 00:05:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:05:20,060 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2023-11-25 00:05:20,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 21 states have internal predecessors, (37), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-25 00:05:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2023-11-25 00:05:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-25 00:05:20,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:05:20,062 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:05:20,072 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-25 00:05:20,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-25 00:05:20,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-25 00:05:20,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:05:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1076082386, now seen corresponding path program 1 times [2023-11-25 00:05:20,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:05:20,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478572056] [2023-11-25 00:05:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:20,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:05:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:05:21,335 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:05:21,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478572056] [2023-11-25 00:05:21,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478572056] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:05:21,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090954916] [2023-11-25 00:05:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:05:21,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:05:21,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:05:21,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:05:21,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b28317b-7878-4c0d-b6a0-b298611dc298/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-25 00:05:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:05:21,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-25 00:05:21,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:05:21,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-25 00:05:21,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-25 00:05:21,881 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-25 00:05:21,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:05:21,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-11-25 00:05:21,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:05:21,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-11-25 00:05:21,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:05:21,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-25 00:05:21,929 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-25 00:05:21,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-25 00:05:21,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-11-25 00:05:21,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-25 00:05:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2023-11-25 00:05:22,020 INFO L327 TraceCheckSpWp]: Computing backward predicates...