./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --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 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:57:07,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:57:07,950 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-06 20:57:07,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:57:07,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:57:08,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:57:08,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:57:08,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:57:08,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:57:08,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:57:08,017 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:57:08,018 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:57:08,018 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:57:08,020 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:57:08,021 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:57:08,021 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:57:08,022 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:57:08,022 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:57:08,023 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:57:08,024 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:57:08,024 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:57:08,025 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:57:08,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 20:57:08,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 20:57:08,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:57:08,028 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:57:08,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:57:08,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:57:08,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:57:08,030 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 20:57:08,031 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 20:57:08,032 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 20:57:08,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:57:08,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 20:57:08,033 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 20:57:08,033 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:57:08,033 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:57:08,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:57:08,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:57:08,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:57:08,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:57:08,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:57:08,036 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:57:08,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:57:08,036 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:57:08,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:57:08,037 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_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/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_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 277634da297b7f9e262585608ed7ad62cca7d59b0122d4e61ee1b4b78256acae [2023-11-06 20:57:08,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:57:08,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:57:08,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:57:08,353 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:57:08,355 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:57:08,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2023-11-06 20:57:11,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:57:11,759 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:57:11,760 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/sv-benchmarks/c/list-simple/sll2n_prepend_unequal.i [2023-11-06 20:57:11,781 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/data/56c39da9b/5343da076a8244f29e377a37151a2d55/FLAG07beedaa2 [2023-11-06 20:57:11,796 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/data/56c39da9b/5343da076a8244f29e377a37151a2d55 [2023-11-06 20:57:11,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:57:11,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:57:11,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:57:11,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:57:11,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:57:11,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:57:11" (1/1) ... [2023-11-06 20:57:11,816 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92f0977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:11, skipping insertion in model container [2023-11-06 20:57:11,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:57:11" (1/1) ... [2023-11-06 20:57:11,881 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:57:12,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:57:12,290 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:57:12,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:57:12,407 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:57:12,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12 WrapperNode [2023-11-06 20:57:12,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:57:12,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:57:12,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:57:12,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:57:12,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,463 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 120 [2023-11-06 20:57:12,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:57:12,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:57:12,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:57:12,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:57:12,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:57:12,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:57:12,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:57:12,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:57:12,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (1/1) ... [2023-11-06 20:57:12,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:57:12,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:12,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:57:12,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:57:12,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 20:57:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:57:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 20:57:12,598 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 20:57:12,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 20:57:12,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:57:12,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:57:12,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 20:57:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 20:57:12,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:57:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 20:57:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:57:12,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:57:12,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:57:12,734 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:57:12,736 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:57:13,176 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:57:13,263 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:57:13,263 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 20:57:13,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:57:13 BoogieIcfgContainer [2023-11-06 20:57:13,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:57:13,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:57:13,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:57:13,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:57:13,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:57:11" (1/3) ... [2023-11-06 20:57:13,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e18484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:57:13, skipping insertion in model container [2023-11-06 20:57:13,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:57:12" (2/3) ... [2023-11-06 20:57:13,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68e18484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:57:13, skipping insertion in model container [2023-11-06 20:57:13,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:57:13" (3/3) ... [2023-11-06 20:57:13,278 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2023-11-06 20:57:13,296 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:57:13,296 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-11-06 20:57:13,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:57:13,355 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;@1bd2a112, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:57:13,355 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-06 20:57:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:57:13,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:13,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:57:13,369 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:13,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1158251612, now seen corresponding path program 1 times [2023-11-06 20:57:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:13,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454442900] [2023-11-06 20:57:13,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:13,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:13,745 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-06 20:57:13,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:13,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454442900] [2023-11-06 20:57:13,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454442900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:13,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:13,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:57:13,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159339107] [2023-11-06 20:57:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:13,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:57:13,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:13,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:57:13,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:57:13,811 INFO L87 Difference]: Start difference. First operand has 68 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 64 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:57:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:13,910 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2023-11-06 20:57:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:57:13,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 20:57:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:13,923 INFO L225 Difference]: With dead ends: 73 [2023-11-06 20:57:13,923 INFO L226 Difference]: Without dead ends: 71 [2023-11-06 20:57:13,925 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-06 20:57:13,930 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:13,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 116 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-06 20:57:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2023-11-06 20:57:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 32 states have (on average 2.09375) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2023-11-06 20:57:13,983 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 6 [2023-11-06 20:57:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:13,983 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2023-11-06 20:57:13,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:57:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2023-11-06 20:57:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:57:13,984 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:13,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:57:13,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:57:13,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:13,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:13,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1015046275, now seen corresponding path program 1 times [2023-11-06 20:57:13,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:13,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568175338] [2023-11-06 20:57:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:14,101 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-06 20:57:14,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:14,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568175338] [2023-11-06 20:57:14,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568175338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:14,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:14,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:57:14,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017339869] [2023-11-06 20:57:14,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:14,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:57:14,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:14,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:57:14,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:57:14,106 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:57:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:14,207 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2023-11-06 20:57:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:57:14,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 20:57:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:14,209 INFO L225 Difference]: With dead ends: 64 [2023-11-06 20:57:14,209 INFO L226 Difference]: Without dead ends: 64 [2023-11-06 20:57:14,210 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-06 20:57:14,212 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:14,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:14,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-06 20:57:14,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-06 20:57:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 32 states have (on average 2.03125) internal successors, (65), 60 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2023-11-06 20:57:14,228 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 6 [2023-11-06 20:57:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:14,229 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2023-11-06 20:57:14,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:57:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2023-11-06 20:57:14,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 20:57:14,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:14,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 20:57:14,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:57:14,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:14,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1015046276, now seen corresponding path program 1 times [2023-11-06 20:57:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:14,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074176456] [2023-11-06 20:57:14,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:14,332 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-06 20:57:14,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:14,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074176456] [2023-11-06 20:57:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074176456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:14,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:14,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:57:14,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254997311] [2023-11-06 20:57:14,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:14,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:57:14,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:14,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:57:14,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:57:14,336 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:57:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:14,413 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2023-11-06 20:57:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:57:14,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-06 20:57:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:14,415 INFO L225 Difference]: With dead ends: 62 [2023-11-06 20:57:14,415 INFO L226 Difference]: Without dead ends: 62 [2023-11-06 20:57:14,415 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-06 20:57:14,417 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:14,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 85 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-06 20:57:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-06 20:57:14,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 32 states have (on average 1.96875) internal successors, (63), 58 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2023-11-06 20:57:14,433 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 6 [2023-11-06 20:57:14,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:14,433 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2023-11-06 20:57:14,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:57:14,434 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2023-11-06 20:57:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:57:14,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:14,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:14,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:57:14,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:14,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1287530719, now seen corresponding path program 1 times [2023-11-06 20:57:14,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:14,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126971234] [2023-11-06 20:57:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:14,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:14,588 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-06 20:57:14,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:14,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126971234] [2023-11-06 20:57:14,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126971234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:14,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:14,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:57:14,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668632348] [2023-11-06 20:57:14,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:14,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:57:14,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:14,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:57:14,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:57:14,592 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 20:57:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:14,799 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2023-11-06 20:57:14,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:57:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-11-06 20:57:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:14,806 INFO L225 Difference]: With dead ends: 62 [2023-11-06 20:57:14,807 INFO L226 Difference]: Without dead ends: 62 [2023-11-06 20:57:14,807 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-06 20:57:14,817 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:14,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 170 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:57:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-06 20:57:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-11-06 20:57:14,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 32 states have (on average 1.9375) internal successors, (62), 57 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:14,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2023-11-06 20:57:14,836 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 10 [2023-11-06 20:57:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:14,836 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2023-11-06 20:57:14,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 20:57:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2023-11-06 20:57:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 20:57:14,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:14,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:14,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:57:14,838 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:14,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1287530720, now seen corresponding path program 1 times [2023-11-06 20:57:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:14,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308320887] [2023-11-06 20:57:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:15,155 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-06 20:57:15,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:15,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308320887] [2023-11-06 20:57:15,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308320887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:15,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:15,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:57:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34173856] [2023-11-06 20:57:15,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:15,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:57:15,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:15,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:57:15,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:57:15,161 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-06 20:57:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:15,305 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2023-11-06 20:57:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:57:15,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-06 20:57:15,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:15,306 INFO L225 Difference]: With dead ends: 61 [2023-11-06 20:57:15,307 INFO L226 Difference]: Without dead ends: 61 [2023-11-06 20:57:15,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 20:57:15,310 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:15,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 199 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-06 20:57:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-06 20:57:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.90625) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2023-11-06 20:57:15,329 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 10 [2023-11-06 20:57:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:15,329 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2023-11-06 20:57:15,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 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-06 20:57:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2023-11-06 20:57:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 20:57:15,333 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:15,334 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:15,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:57:15,334 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:15,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:15,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1408807463, now seen corresponding path program 1 times [2023-11-06 20:57:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698447634] [2023-11-06 20:57:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:57:15,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:15,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698447634] [2023-11-06 20:57:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698447634] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:15,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427167260] [2023-11-06 20:57:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:15,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:15,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:15,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:57:15,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 20:57:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:15,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 20:57:15,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:57:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 20:57:15,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:57:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:57:15,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427167260] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 20:57:15,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1265633491] [2023-11-06 20:57:15,776 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-06 20:57:15,776 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:57:15,781 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:57:15,786 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:57:15,787 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 20:57:18,289 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 146 for LOIs [2023-11-06 20:57:18,969 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 20:57:25,137 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '845#(and (<= 1 |#StackHeapBarrier|) (= 5 |ULTIMATE.start_sll_prepend_#in~data#1|) (or (and (<= 8 (select |#length| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (exists ((|v_#length_71| (Array Int Int))) (= |#length| (store |v_#length_71| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (= 1 (select |v_old(#valid)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_17| |ULTIMATE.start_sll_create_#res#1.base|))) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 1) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_#valid_86| (Array Int Int))) (and (= (select |v_#valid_86| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_86| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_56| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 5))) (= |v_#memory_int_56| (store |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_56| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (exists ((|v_#memory_int_59| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_59| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (and (<= 8 (select |#length| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (exists ((|v_#length_71| (Array Int Int))) (= |#length| (store |v_#length_71| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (exists ((|v_#memory_$Pointer$.offset_71| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_71| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_75| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |ULTIMATE.start_sll_prepend_~head#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (= (select |#valid| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 1) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#valid_86| (Array Int Int))) (and (= (select |v_#valid_86| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_86| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|))) (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_71| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_71| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.base_75| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_75| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_#memory_int_55| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_56| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_56| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 5))) (= |v_#memory_int_56| (store |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_56| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (exists ((|v_#memory_int_59| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_59| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_59| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 4))) |v_old(#memory_int)_AFTER_CALL_9|)))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= 5 |ULTIMATE.start_sll_prepend_~data#1|) (not (= (select |#valid| |ULTIMATE.start_sll_prepend_~head#1.base|) 1)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_prepend_~head#1.base|) (<= 2 |ULTIMATE.start_sll_prepend_#in~head#1.base|) (= |ULTIMATE.start_sll_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-06 20:57:25,138 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 20:57:25,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 20:57:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 20:57:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440823644] [2023-11-06 20:57:25,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 20:57:25,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:57:25,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:25,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:57:25,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=231, Unknown=4, NotChecked=0, Total=272 [2023-11-06 20:57:25,141 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 20:57:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:25,196 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2023-11-06 20:57:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:57:25,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-11-06 20:57:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:25,198 INFO L225 Difference]: With dead ends: 64 [2023-11-06 20:57:25,198 INFO L226 Difference]: Without dead ends: 64 [2023-11-06 20:57:25,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=37, Invalid=231, Unknown=4, NotChecked=0, Total=272 [2023-11-06 20:57:25,199 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:25,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 20:57:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-06 20:57:25,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-11-06 20:57:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 59 states have internal predecessors, (64), 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-06 20:57:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2023-11-06 20:57:25,205 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 19 [2023-11-06 20:57:25,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:25,205 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2023-11-06 20:57:25,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-06 20:57:25,206 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2023-11-06 20:57:25,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 20:57:25,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:25,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:25,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 20:57:25,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:25,418 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:25,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:25,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1700842470, now seen corresponding path program 2 times [2023-11-06 20:57:25,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:25,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931232350] [2023-11-06 20:57:25,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:25,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 20:57:25,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:25,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931232350] [2023-11-06 20:57:25,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931232350] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:25,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805242418] [2023-11-06 20:57:25,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 20:57:25,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:25,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:25,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:57:26,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 20:57:26,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 20:57:26,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 20:57:26,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-06 20:57:26,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:57:26,217 INFO L351 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-06 20:57:26,249 INFO L351 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-06 20:57:26,266 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-11-06 20:57:26,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:26,295 INFO L351 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-06 20:57:26,326 INFO L351 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-06 20:57:26,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:26,372 INFO L351 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-06 20:57:26,414 INFO L351 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-06 20:57:26,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:26,448 INFO L351 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-06 20:57:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 20:57:26,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:57:26,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805242418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:26,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:57:26,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-06 20:57:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743570409] [2023-11-06 20:57:26,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:26,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:57:26,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:26,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:57:26,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2023-11-06 20:57:26,455 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:26,594 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2023-11-06 20:57:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:57:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-06 20:57:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:26,595 INFO L225 Difference]: With dead ends: 62 [2023-11-06 20:57:26,595 INFO L226 Difference]: Without dead ends: 62 [2023-11-06 20:57:26,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-11-06 20:57:26,597 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:26,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 113 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 80 Unchecked, 0.1s Time] [2023-11-06 20:57:26,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-06 20:57:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-06 20:57:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 57 states have internal predecessors, (62), 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-06 20:57:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2023-11-06 20:57:26,602 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 28 [2023-11-06 20:57:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:26,603 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2023-11-06 20:57:26,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:26,603 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2023-11-06 20:57:26,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 20:57:26,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:26,605 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:26,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 20:57:26,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:26,811 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:26,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1700842469, now seen corresponding path program 1 times [2023-11-06 20:57:26,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:26,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278808865] [2023-11-06 20:57:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:26,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:57:27,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:27,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278808865] [2023-11-06 20:57:27,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278808865] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:27,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110357483] [2023-11-06 20:57:27,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:27,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:27,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:27,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:57:27,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 20:57:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:27,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 20:57:27,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:57:27,803 INFO L351 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-06 20:57:27,843 INFO L351 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-06 20:57:27,852 WARN L861 $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-06 20:57:27,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:27,881 INFO L351 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-06 20:57:27,918 INFO L351 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-06 20:57:27,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:27,957 INFO L351 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-06 20:57:28,017 INFO L351 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-06 20:57:28,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:28,061 INFO L351 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-06 20:57:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 20:57:28,092 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 20:57:28,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110357483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:28,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 20:57:28,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2023-11-06 20:57:28,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696123458] [2023-11-06 20:57:28,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:28,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:57:28,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:28,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:57:28,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2023-11-06 20:57:28,096 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:28,239 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2023-11-06 20:57:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:57:28,242 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-06 20:57:28,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:28,243 INFO L225 Difference]: With dead ends: 60 [2023-11-06 20:57:28,243 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 20:57:28,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=251, Unknown=1, NotChecked=32, Total=342 [2023-11-06 20:57:28,246 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:28,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 147 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2023-11-06 20:57:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 20:57:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-11-06 20:57:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 55 states have internal predecessors, (60), 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-06 20:57:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2023-11-06 20:57:28,252 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 28 [2023-11-06 20:57:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:28,252 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2023-11-06 20:57:28,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2023-11-06 20:57:28,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 20:57:28,254 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:28,254 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:28,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 20:57:28,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:28,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:28,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1186509017, now seen corresponding path program 1 times [2023-11-06 20:57:28,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:28,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290577102] [2023-11-06 20:57:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:28,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 20:57:28,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290577102] [2023-11-06 20:57:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290577102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:28,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:28,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:57:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732102863] [2023-11-06 20:57:28,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:28,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:57:28,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:28,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:57:28,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:57:28,672 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 20:57:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:28,812 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2023-11-06 20:57:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:57:28,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-11-06 20:57:28,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:28,814 INFO L225 Difference]: With dead ends: 59 [2023-11-06 20:57:28,814 INFO L226 Difference]: Without dead ends: 59 [2023-11-06 20:57:28,815 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-06 20:57:28,816 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 3 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:28,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 157 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-06 20:57:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-06 20:57:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 54 states have internal predecessors, (59), 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-06 20:57:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2023-11-06 20:57:28,821 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 29 [2023-11-06 20:57:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:28,821 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2023-11-06 20:57:28,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-06 20:57:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2023-11-06 20:57:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 20:57:28,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:28,823 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:28,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 20:57:28,823 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:28,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1186509018, now seen corresponding path program 1 times [2023-11-06 20:57:28,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:28,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013564472] [2023-11-06 20:57:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:28,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 20:57:28,947 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:28,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013564472] [2023-11-06 20:57:28,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013564472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:28,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:28,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:57:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838166532] [2023-11-06 20:57:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:28,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:57:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:57:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:57:28,950 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-06 20:57:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:29,063 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2023-11-06 20:57:29,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:57:29,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 29 [2023-11-06 20:57:29,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:29,065 INFO L225 Difference]: With dead ends: 58 [2023-11-06 20:57:29,065 INFO L226 Difference]: Without dead ends: 58 [2023-11-06 20:57:29,065 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-06 20:57:29,066 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 3 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:29,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-06 20:57:29,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-06 20:57:29,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 53 states have internal predecessors, (58), 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-06 20:57:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2023-11-06 20:57:29,070 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 29 [2023-11-06 20:57:29,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:29,070 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2023-11-06 20:57:29,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-06 20:57:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2023-11-06 20:57:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 20:57:29,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:29,077 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:29,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 20:57:29,078 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:29,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:29,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2068707082, now seen corresponding path program 1 times [2023-11-06 20:57:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:29,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705380884] [2023-11-06 20:57:29,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 20:57:29,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:29,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705380884] [2023-11-06 20:57:29,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705380884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:29,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:29,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:57:29,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919622873] [2023-11-06 20:57:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:29,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:57:29,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:29,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:57:29,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:57:29,205 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:29,266 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2023-11-06 20:57:29,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:57:29,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-11-06 20:57:29,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:29,269 INFO L225 Difference]: With dead ends: 66 [2023-11-06 20:57:29,270 INFO L226 Difference]: Without dead ends: 66 [2023-11-06 20:57:29,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:57:29,271 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:29,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 70 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:29,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-06 20:57:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2023-11-06 20:57:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.6) internal successors, (56), 51 states have internal predecessors, (56), 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-06 20:57:29,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2023-11-06 20:57:29,279 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 31 [2023-11-06 20:57:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:29,281 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2023-11-06 20:57:29,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2023-11-06 20:57:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 20:57:29,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:29,285 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:29,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 20:57:29,286 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:29,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2068707081, now seen corresponding path program 1 times [2023-11-06 20:57:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:29,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28436773] [2023-11-06 20:57:29,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:29,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-06 20:57:29,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:29,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28436773] [2023-11-06 20:57:29,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28436773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:29,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:57:29,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56926845] [2023-11-06 20:57:29,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:29,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:57:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:29,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:57:29,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:57:29,589 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:29,686 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2023-11-06 20:57:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:57:29,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2023-11-06 20:57:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:29,688 INFO L225 Difference]: With dead ends: 54 [2023-11-06 20:57:29,688 INFO L226 Difference]: Without dead ends: 54 [2023-11-06 20:57:29,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-06 20:57:29,689 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:29,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 100 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-06 20:57:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-06 20:57:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.542857142857143) internal successors, (54), 49 states have internal predecessors, (54), 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-06 20:57:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2023-11-06 20:57:29,692 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 31 [2023-11-06 20:57:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:29,693 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2023-11-06 20:57:29,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2023-11-06 20:57:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 20:57:29,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:29,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:29,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 20:57:29,694 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:29,695 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:29,695 INFO L85 PathProgramCache]: Analyzing trace with hash 294593414, now seen corresponding path program 1 times [2023-11-06 20:57:29,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:29,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252241161] [2023-11-06 20:57:29,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:29,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 20:57:29,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:29,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252241161] [2023-11-06 20:57:29,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252241161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:29,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:29,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 20:57:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840664233] [2023-11-06 20:57:29,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:29,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 20:57:29,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:29,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 20:57:29,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:57:29,973 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 9 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:30,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:30,135 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2023-11-06 20:57:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 20:57:30,136 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2023-11-06 20:57:30,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:30,137 INFO L225 Difference]: With dead ends: 65 [2023-11-06 20:57:30,137 INFO L226 Difference]: Without dead ends: 65 [2023-11-06 20:57:30,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-06 20:57:30,138 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 47 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:30,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 137 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-06 20:57:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2023-11-06 20:57:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.457142857142857) internal successors, (51), 46 states have internal predecessors, (51), 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-06 20:57:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2023-11-06 20:57:30,141 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 32 [2023-11-06 20:57:30,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:30,141 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2023-11-06 20:57:30,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:30,141 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2023-11-06 20:57:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 20:57:30,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:30,142 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:30,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 20:57:30,143 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:30,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:30,143 INFO L85 PathProgramCache]: Analyzing trace with hash 294593415, now seen corresponding path program 1 times [2023-11-06 20:57:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:30,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29988528] [2023-11-06 20:57:30,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:30,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 20:57:30,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:30,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29988528] [2023-11-06 20:57:30,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29988528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:30,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:30,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 20:57:30,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759850185] [2023-11-06 20:57:30,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:30,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 20:57:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:30,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 20:57:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 20:57:30,580 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:30,742 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2023-11-06 20:57:30,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 20:57:30,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2023-11-06 20:57:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:30,744 INFO L225 Difference]: With dead ends: 53 [2023-11-06 20:57:30,744 INFO L226 Difference]: Without dead ends: 53 [2023-11-06 20:57:30,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-06 20:57:30,745 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 40 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:30,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 149 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:57:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-06 20:57:30,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-11-06 20:57:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.4) internal successors, (49), 44 states have internal predecessors, (49), 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-06 20:57:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-11-06 20:57:30,748 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 32 [2023-11-06 20:57:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:30,748 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-06 20:57:30,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-11-06 20:57:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 20:57:30,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:30,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:30,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 20:57:30,749 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:30,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1498456602, now seen corresponding path program 1 times [2023-11-06 20:57:30,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:30,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760973627] [2023-11-06 20:57:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 20:57:31,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:31,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760973627] [2023-11-06 20:57:31,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760973627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:57:31,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:57:31,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 20:57:31,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844996423] [2023-11-06 20:57:31,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:57:31,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 20:57:31,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:57:31,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 20:57:31,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-06 20:57:31,403 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:57:31,678 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2023-11-06 20:57:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 20:57:31,679 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2023-11-06 20:57:31,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:57:31,679 INFO L225 Difference]: With dead ends: 49 [2023-11-06 20:57:31,679 INFO L226 Difference]: Without dead ends: 49 [2023-11-06 20:57:31,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-11-06 20:57:31,680 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 68 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:57:31,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 184 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:57:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-06 20:57:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-06 20:57:31,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 44 states have internal predecessors, (48), 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-06 20:57:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-11-06 20:57:31,683 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 36 [2023-11-06 20:57:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:57:31,684 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-11-06 20:57:31,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 20:57:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-11-06 20:57:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 20:57:31,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:57:31,684 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:57:31,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 20:57:31,685 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-06 20:57:31,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:57:31,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1498365112, now seen corresponding path program 1 times [2023-11-06 20:57:31,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:57:31,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394131349] [2023-11-06 20:57:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:57:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 20:57:33,004 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:57:33,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394131349] [2023-11-06 20:57:33,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394131349] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:33,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582724769] [2023-11-06 20:57:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:57:33,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 20:57:33,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:57:33,006 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 20:57:33,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4f92763-d380-47dc-99ff-27a4a6406e2a/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 20:57:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:57:33,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-06 20:57:33,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 20:57:33,277 INFO L351 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-06 20:57:33,481 INFO L351 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-06 20:57:33,671 INFO L322 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-06 20:57:33,671 INFO L351 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 21 [2023-11-06 20:57:33,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:33,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-06 20:57:33,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:33,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-11-06 20:57:34,035 INFO L351 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 15 treesize of output 1 [2023-11-06 20:57:34,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 20:57:34,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2023-11-06 20:57:34,117 INFO L351 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 27 treesize of output 19 [2023-11-06 20:57:34,240 INFO L322 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-06 20:57:34,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2023-11-06 20:57:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 20:57:34,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 20:57:34,391 INFO L351 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 84 treesize of output 80 [2023-11-06 20:57:37,394 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_952 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| Int) (v_arrayElimCell_22 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| 1)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| 1) (select (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (store v_ArrVal_952 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_952) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse12 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_22))) 1)))) (.cse1 (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or .cse0 .cse1) (or .cse0 .cse2) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| 1)) (forall ((v_ArrVal_952 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (v_arrayElimCell_22 Int)) (let ((.cse5 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| 1)) (.cse4 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (store v_ArrVal_952 .cse5 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_952) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (select .cse3 (select .cse4 .cse5)) 1) (= (select .cse3 (select .cse4 (+ 4 v_arrayElimCell_22))) 1))))))) (or (not .cse1) (forall ((v_ArrVal_952 (Array Int Int)) (|ULTIMATE.start_sll_prepend_~new_head~1#1.offset| Int) (|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| 1)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| 1) (let ((.cse10 (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.offset| 4))) (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| (store v_ArrVal_952 .cse10 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20| v_ArrVal_952) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_20|))))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse10))) 1))) (not .cse2)))) is different from false [2023-11-06 20:57:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582724769] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 20:57:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1409122861] [2023-11-06 20:57:37,405 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-06 20:57:37,406 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 20:57:37,406 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 20:57:37,406 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 20:57:37,407 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs