./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.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_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/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_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/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_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:05:15,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:05:15,642 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-06 21:05:15,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:05:15,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:05:15,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:05:15,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:05:15,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:05:15,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:05:15,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:05:15,700 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 21:05:15,702 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 21:05:15,702 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 21:05:15,704 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 21:05:15,705 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 21:05:15,705 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 21:05:15,706 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 21:05:15,708 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 21:05:15,708 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 21:05:15,709 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 21:05:15,709 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 21:05:15,710 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 21:05:15,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:05:15,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:05:15,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:05:15,713 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:05:15,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:05:15,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:05:15,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:05:15,715 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:05:15,716 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:05:15,717 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:05:15,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:05:15,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:05:15,718 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:05:15,718 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:05:15,718 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:05:15,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:05:15,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:05:15,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:05:15,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:05:15,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:05:15,725 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 21:05:15,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:05:15,726 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 21:05:15,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:05:15,726 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_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/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_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2023-11-06 21:05:16,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:05:16,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:05:16,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:05:16,100 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:05:16,102 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:05:16,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-06 21:05:19,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:05:19,696 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:05:19,696 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2023-11-06 21:05:19,723 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/data/fd37b9c19/2e51d5f3464549c3938ba63e4da13024/FLAG67eaa29c3 [2023-11-06 21:05:19,746 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/data/fd37b9c19/2e51d5f3464549c3938ba63e4da13024 [2023-11-06 21:05:19,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:05:19,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:05:19,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:05:19,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:05:19,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:05:19,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:05:19" (1/1) ... [2023-11-06 21:05:19,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0e34aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:19, skipping insertion in model container [2023-11-06 21:05:19,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:05:19" (1/1) ... [2023-11-06 21:05:19,831 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:05:20,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:05:20,178 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:05:20,230 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:05:20,270 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:05:20,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20 WrapperNode [2023-11-06 21:05:20,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:05:20,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:05:20,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:05:20,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:05:20,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,354 INFO L138 Inliner]: procedures = 127, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 111 [2023-11-06 21:05:20,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:05:20,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:05:20,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:05:20,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:05:20,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:05:20,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:05:20,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:05:20,415 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:05:20,416 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (1/1) ... [2023-11-06 21:05:20,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:05:20,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:05:20,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:05:20,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:05:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:05:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:05:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-06 21:05:20,506 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-06 21:05:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:05:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:05:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:05:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:05:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:05:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:05:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-06 21:05:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:05:20,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:05:20,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:05:20,663 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:05:20,666 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:05:21,112 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:05:21,211 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:05:21,212 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 21:05:21,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:05:21 BoogieIcfgContainer [2023-11-06 21:05:21,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:05:21,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:05:21,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:05:21,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:05:21,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:05:19" (1/3) ... [2023-11-06 21:05:21,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff4c8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:05:21, skipping insertion in model container [2023-11-06 21:05:21,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:05:20" (2/3) ... [2023-11-06 21:05:21,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ff4c8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:05:21, skipping insertion in model container [2023-11-06 21:05:21,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:05:21" (3/3) ... [2023-11-06 21:05:21,223 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2023-11-06 21:05:21,250 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:05:21,250 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-11-06 21:05:21,318 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:05:21,327 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;@15147e83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 21:05:21,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-11-06 21:05:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 57 states have internal predecessors, (64), 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 21:05:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 21:05:21,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:21,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 21:05:21,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:21,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 773697468, now seen corresponding path program 1 times [2023-11-06 21:05:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:21,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791731324] [2023-11-06 21:05:21,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:21,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:21,756 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 21:05:21,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:05:21,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791731324] [2023-11-06 21:05:21,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791731324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:05:21,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:05:21,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:05:21,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302098812] [2023-11-06 21:05:21,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:05:21,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:05:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:21,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:05:21,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:05:21,828 INFO L87 Difference]: Start difference. First operand has 61 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 57 states have internal predecessors, (64), 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 21:05:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:21,932 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2023-11-06 21:05:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:05:21,935 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 21:05:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:21,944 INFO L225 Difference]: With dead ends: 66 [2023-11-06 21:05:21,945 INFO L226 Difference]: Without dead ends: 64 [2023-11-06 21:05:21,947 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 21:05:21,952 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:05:21,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 102 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:05:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-06 21:05:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2023-11-06 21:05:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 55 states have internal predecessors, (59), 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 21:05:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2023-11-06 21:05:22,010 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 6 [2023-11-06 21:05:22,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:22,011 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2023-11-06 21:05:22,011 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 21:05:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2023-11-06 21:05:22,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 21:05:22,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:22,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 21:05:22,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:05:22,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:22,015 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 642497904, now seen corresponding path program 1 times [2023-11-06 21:05:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:22,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082700460] [2023-11-06 21:05:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:22,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:22,137 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 21:05:22,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:05:22,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082700460] [2023-11-06 21:05:22,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082700460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:05:22,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:05:22,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:05:22,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907122041] [2023-11-06 21:05:22,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:05:22,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:05:22,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:05:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:05:22,141 INFO L87 Difference]: Start difference. First operand 59 states and 63 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 21:05:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:22,217 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2023-11-06 21:05:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:05:22,218 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 21:05:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:22,219 INFO L225 Difference]: With dead ends: 57 [2023-11-06 21:05:22,219 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 21:05:22,220 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 21:05:22,222 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 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 21:05:22,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:05:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 21:05:22,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-06 21:05:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 53 states have internal predecessors, (57), 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 21:05:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2023-11-06 21:05:22,232 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 6 [2023-11-06 21:05:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:22,232 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2023-11-06 21:05:22,233 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 21:05:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2023-11-06 21:05:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-06 21:05:22,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:22,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 21:05:22,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:05:22,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:22,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash 642497905, now seen corresponding path program 1 times [2023-11-06 21:05:22,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:22,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241703644] [2023-11-06 21:05:22,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:22,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:22,330 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 21:05:22,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:05:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241703644] [2023-11-06 21:05:22,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241703644] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:05:22,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:05:22,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:05:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344246886] [2023-11-06 21:05:22,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:05:22,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:05:22,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:22,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:05:22,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:05:22,334 INFO L87 Difference]: Start difference. First operand 57 states and 61 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 21:05:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:22,408 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2023-11-06 21:05:22,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:05:22,409 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 21:05:22,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:22,410 INFO L225 Difference]: With dead ends: 55 [2023-11-06 21:05:22,411 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 21:05:22,411 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 21:05:22,413 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:05:22,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 74 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:05:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 21:05:22,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-06 21:05:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.896551724137931) internal successors, (55), 51 states have internal predecessors, (55), 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 21:05:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2023-11-06 21:05:22,423 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 6 [2023-11-06 21:05:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:22,423 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2023-11-06 21:05:22,424 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 21:05:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2023-11-06 21:05:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 21:05:22,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:22,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:05:22,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:05:22,426 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:22,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1988208076, now seen corresponding path program 1 times [2023-11-06 21:05:22,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:22,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397653571] [2023-11-06 21:05:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:22,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:22,563 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 21:05:22,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:05:22,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397653571] [2023-11-06 21:05:22,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397653571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:05:22,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:05:22,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:05:22,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682766628] [2023-11-06 21:05:22,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:05:22,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:05:22,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:22,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:05:22,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:05:22,568 INFO L87 Difference]: Start difference. First operand 55 states and 59 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 21:05:22,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:22,741 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2023-11-06 21:05:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:05:22,742 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 21:05:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:22,745 INFO L225 Difference]: With dead ends: 55 [2023-11-06 21:05:22,745 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 21:05:22,745 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 21:05:22,747 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:05:22,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 147 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:05:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 21:05:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2023-11-06 21:05:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 50 states have internal predecessors, (54), 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 21:05:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-11-06 21:05:22,755 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 10 [2023-11-06 21:05:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:22,756 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-11-06 21:05:22,756 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 21:05:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-11-06 21:05:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 21:05:22,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:22,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:05:22,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:05:22,758 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:22,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1988208077, now seen corresponding path program 1 times [2023-11-06 21:05:22,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:22,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823107470] [2023-11-06 21:05:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:23,063 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 21:05:23,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:05:23,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823107470] [2023-11-06 21:05:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823107470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:05:23,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:05:23,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:05:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344423851] [2023-11-06 21:05:23,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:05:23,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:05:23,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:23,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:05:23,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:05:23,069 INFO L87 Difference]: Start difference. First operand 54 states and 58 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 21:05:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:23,242 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-11-06 21:05:23,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:05:23,243 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 21:05:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:23,246 INFO L225 Difference]: With dead ends: 54 [2023-11-06 21:05:23,247 INFO L226 Difference]: Without dead ends: 54 [2023-11-06 21:05:23,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:05:23,251 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 3 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:05:23,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 159 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:05:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-06 21:05:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2023-11-06 21:05:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 49 states have internal predecessors, (53), 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 21:05:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2023-11-06 21:05:23,273 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2023-11-06 21:05:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:23,274 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2023-11-06 21:05:23,274 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 21:05:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2023-11-06 21:05:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 21:05:23,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:23,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:05:23,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:05:23,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:23,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:23,277 INFO L85 PathProgramCache]: Analyzing trace with hash -760723014, now seen corresponding path program 1 times [2023-11-06 21:05:23,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:23,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613945163] [2023-11-06 21:05:23,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:23,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:23,397 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 21:05:23,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:05:23,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613945163] [2023-11-06 21:05:23,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613945163] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:05:23,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221746661] [2023-11-06 21:05:23,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:23,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:05:23,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:05:23,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:05:23,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:05:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:23,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:05:23,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:05:23,606 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 21:05:23,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:05:23,648 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 21:05:23,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221746661] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:05:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1147955218] [2023-11-06 21:05:23,681 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-06 21:05:23,683 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 21:05:23,687 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 21:05:23,717 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 21:05:23,717 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 21:05:26,325 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-06 21:05:27,109 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 21:05:27,127 WARN L861 $PredicateComparison]: unable to prove that (and (not (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_prepend_~head#1.base|))) (= 0 |c_ULTIMATE.start_sll_prepend_~new_head~1#1.offset|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_prepend_~head#1.base|) (<= 1 |c_#StackHeapBarrier|) (= 1 |c_ULTIMATE.start_sll_prepend_~data#1|) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_prepend_#in~data#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (<= 2 |c_ULTIMATE.start_sll_prepend_#in~head#1.base|) (= |c_ULTIMATE.start_sll_prepend_#in~head#1.offset| 0) (let ((.cse0 (<= (+ |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |c_#StackHeapBarrier|)) (.cse1 (= |c_ULTIMATE.start_sll_prepend_#in~head#1.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|)) (.cse2 (= (select |c_#valid| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 1)) (.cse3 (exists ((|v_#length_65| (Array Int Int))) (= (store |v_#length_65| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8) |c_#length|))) (.cse4 (= |c_ULTIMATE.start_sll_prepend_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (exists ((|v_#valid_80| (Array Int Int))) (and (= 0 (select |v_#valid_80| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (= |c_#valid| (store |v_#valid_80| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1))))) (.cse6 (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_68| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_68| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0)))))) (.cse7 (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_72| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_72| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (.cse8 (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_68| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_68| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 0) 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0)))))) (.cse9 (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))) (.cse10 (not (= |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0))) (.cse11 (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int)))) (let ((.cse12 (select |v_#memory_int_55| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|))) (and (= (store |v_#memory_int_55| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store .cse12 0 1)) |c_#memory_int|) (= (store |v_#memory_int_54| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_54| |c_ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select .cse12 4))) |v_#memory_int_55|)))))) (or (and .cse0 (exists ((|v_#memory_$Pointer$.base_72| (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_72| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_72| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) |c_ULTIMATE.start_sll_create_#res#1.base|))) .cse1 .cse2 (exists ((|v_old(#length)_AFTER_CALL_9| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_9| |c_ULTIMATE.start_sll_create_#res#1.base|))) .cse3 .cse4 .cse5 (exists ((|v_#memory_int_58| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_9| (store |v_#memory_int_58| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_58| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_9| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_old(#valid)_AFTER_CALL_9| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_9| |c_ULTIMATE.start_sll_create_#res#1.base|) 1)) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|v_#memory_int_58| (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_58| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_58| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_10| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_old(#valid)_AFTER_CALL_10| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_10| |c_ULTIMATE.start_sll_create_#res#1.base|) 1)) .cse6 .cse7 .cse8 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_72| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_72| |c_ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) .cse9 (exists ((|v_#length_BEFORE_CALL_17| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_17| |c_ULTIMATE.start_sll_create_#res#1.base|))) .cse10 .cse11))) (<= 2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~len~0#1| 2)) is different from true [2023-11-06 21:05:33,145 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '767#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_prepend_~data#1| 1) (or (and (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int)))) (and (= |#memory_int| (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|) 0 1))) (= |v_#memory_int_55| (store |v_#memory_int_54| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (<= 8 (select |#length| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_68| |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))))) (= |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) (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_68| |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))))) (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_old(#valid)_AFTER_CALL_9| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_9| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#valid_80| (Array Int Int))) (and (= (store |v_#valid_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_65| (Array Int Int))) (= (store |v_#length_65| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8) |#length|)) (exists ((|v_#memory_int_58| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_int_58| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_58| |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_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= (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|) (= (store |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_72| |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))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_9|)))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (and (= (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|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_72| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_72| |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)))))) (exists ((|v_#memory_int_54| (Array Int (Array Int Int))) (|v_#memory_int_55| (Array Int (Array Int Int)))) (and (= |#memory_int| (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|) 0 1))) (= |v_#memory_int_55| (store |v_#memory_int_54| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_54| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_55| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (<= 8 (select |#length| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (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|))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.base_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_68| |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))))) (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) (exists ((|v_#memory_$Pointer$.offset_68| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_68| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_68| |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))))) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_#valid_80| (Array Int Int))) (and (= (store |v_#valid_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|) (= (select |v_#valid_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0))) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#length_65| (Array Int Int))) (= (store |v_#length_65| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8) |#length|)) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_58| (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_58| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_58| |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))))))) (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~data#1| 1) (= |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 21:05:33,145 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 21:05:33,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:05:33,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-06 21:05:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358179155] [2023-11-06 21:05:33,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:05:33,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:05:33,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:33,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:05:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=206, Unknown=2, NotChecked=28, Total=272 [2023-11-06 21:05:33,149 INFO L87 Difference]: Start difference. First operand 53 states and 57 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 21:05:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:33,213 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-11-06 21:05:33,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:05:33,214 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 21:05:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:33,215 INFO L225 Difference]: With dead ends: 57 [2023-11-06 21:05:33,215 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 21:05:33,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=36, Invalid=206, Unknown=2, NotChecked=28, Total=272 [2023-11-06 21:05:33,216 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:05:33,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 86 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:05:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 21:05:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-06 21:05:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.75) internal successors, (56), 52 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 21:05:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2023-11-06 21:05:33,222 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 19 [2023-11-06 21:05:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:33,223 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2023-11-06 21:05:33,223 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 21:05:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2023-11-06 21:05:33,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 21:05:33,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:33,224 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 21:05:33,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:05:33,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 21:05:33,431 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:33,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1718077274, now seen corresponding path program 2 times [2023-11-06 21:05:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545715499] [2023-11-06 21:05:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 21:05:33,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:05:33,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545715499] [2023-11-06 21:05:33,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545715499] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:05:33,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786262336] [2023-11-06 21:05:33,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:05:33,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:05:33,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:05:33,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:05:34,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:05:34,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 21:05:34,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:05:34,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-06 21:05:34,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:05:34,233 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 21:05:34,260 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 21:05:34,304 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 21:05:34,304 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 14 treesize of output 13 [2023-11-06 21:05:34,381 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 21:05:34,388 WARN L861 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-06 21:05:34,407 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 21:05:34,408 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 12 treesize of output 14 [2023-11-06 21:05:34,462 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 21:05:34,476 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 21:05:34,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:05:34,503 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 21:05:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2023-11-06 21:05:34,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:05:34,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786262336] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:05:34,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [763434783] [2023-11-06 21:05:34,586 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-06 21:05:34,586 INFO L166 IcfgInterpreter]: Building call graph [2023-11-06 21:05:34,586 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-06 21:05:34,586 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-06 21:05:34,587 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-06 21:05:36,290 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 144 for LOIs [2023-11-06 21:05:37,014 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-06 21:05:44,105 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1001#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_prepend_~data#1| 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~data#1| 1) (= |ULTIMATE.start_sll_prepend_#in~head#1.offset| 0) (= |ULTIMATE.start_sll_prepend_~head#1.offset| 0) (or (and (exists ((|v_#memory_int_70| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_20| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_20| (store |v_#memory_int_70| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (<= 8 (select |#length| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (exists ((|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_80| |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))))) (exists ((|v_#memory_int_66| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 1))) (= |v_#memory_int_67| (store |v_#memory_int_66| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_66| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (exists ((|v_#valid_93| (Array Int Int))) (and (= (select |v_#valid_93| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_93| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_80| |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_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) (exists ((|v_#memory_$Pointer$.offset_84| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_84| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_84| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_old(#length)_AFTER_CALL_20| (Array Int Int))) (<= 8 (select |v_old(#length)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|))) (exists ((|v_old(#valid)_AFTER_CALL_20| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#length_72| (Array Int Int))) (= |#length| (store |v_#length_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| (store |v_#memory_$Pointer$.base_84| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_84| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_20| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_84| (Array Int (Array Int Int)))) (and (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| (store |v_#memory_$Pointer$.base_84| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_84| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4)))) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_21| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|))) (<= 8 (select |#length| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 1)) (exists ((|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.base_80| |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))))) (exists ((|v_#memory_int_66| (Array Int (Array Int Int))) (|v_#memory_int_67| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0 1))) (= |v_#memory_int_67| (store |v_#memory_int_66| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (select |v_#memory_int_66| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4 (select (select |v_#memory_int_67| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 4)))))) (exists ((|v_#valid_93| (Array Int Int))) (and (= (select |v_#valid_93| |ULTIMATE.start_sll_prepend_~new_head~1#1.base|) 0) (= (store |v_#valid_93| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#valid|))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_prepend_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_80| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| (store (store (select |v_#memory_$Pointer$.offset_80| |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_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) (exists ((|v_#memory_$Pointer$.offset_84| (Array Int (Array Int Int)))) (= (select (select (store |v_#memory_$Pointer$.offset_84| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_84| |ULTIMATE.start_sll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (not (= |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 0)) (exists ((|v_#memory_int_70| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_21| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_21| (store |v_#memory_int_70| |ULTIMATE.start_sll_create_#res#1.base| (store (select |v_#memory_int_70| |ULTIMATE.start_sll_create_#res#1.base|) 4 (select (select |v_old(#memory_int)_AFTER_CALL_21| |ULTIMATE.start_sll_create_#res#1.base|) 4))))) (exists ((|v_#length_72| (Array Int Int))) (= |#length| (store |v_#length_72| |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 8))) (<= (+ |ULTIMATE.start_sll_prepend_~new_head~1#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_BEFORE_CALL_35| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_35| |ULTIMATE.start_sll_create_#res#1.base|))))) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-11-06 21:05:44,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-06 21:05:44,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:05:44,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2023-11-06 21:05:44,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219968781] [2023-11-06 21:05:44,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:05:44,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 21:05:44,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:44,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 21:05:44,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=666, Unknown=4, NotChecked=106, Total=870 [2023-11-06 21:05:44,108 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 17 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 14 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 21:05:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:44,640 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-11-06 21:05:44,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:05:44,640 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 14 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-11-06 21:05:44,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:44,641 INFO L225 Difference]: With dead ends: 63 [2023-11-06 21:05:44,641 INFO L226 Difference]: Without dead ends: 63 [2023-11-06 21:05:44,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=123, Invalid=811, Unknown=4, NotChecked=118, Total=1056 [2023-11-06 21:05:44,643 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 85 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:05:44,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 157 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 276 Invalid, 0 Unknown, 118 Unchecked, 0.3s Time] [2023-11-06 21:05:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-06 21:05:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2023-11-06 21:05:44,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 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 21:05:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-11-06 21:05:44,649 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 28 [2023-11-06 21:05:44,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:44,650 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-11-06 21:05:44,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 14 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-06 21:05:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-11-06 21:05:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-06 21:05:44,652 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:44,652 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 21:05:44,665 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:05:44,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 21:05:44,859 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:44,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1718077275, now seen corresponding path program 1 times [2023-11-06 21:05:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:44,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261793172] [2023-11-06 21:05:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:44,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:45,902 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 21:05:45,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:05:45,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261793172] [2023-11-06 21:05:45,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261793172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:05:45,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085597192] [2023-11-06 21:05:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:45,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:05:45,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:05:45,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:05:45,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:05:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:46,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 21:05:46,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:05:46,075 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 21:05:46,117 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 21:05:46,126 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 21:05:46,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:05:46,156 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 21:05:46,189 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 21:05:46,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:05:46,226 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 21:05:46,283 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 21:05:46,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:05:46,325 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 21:05:46,352 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 21:05:46,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:05:46,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085597192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:05:46,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 21:05:46,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2023-11-06 21:05:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86108040] [2023-11-06 21:05:46,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:05:46,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:05:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:46,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:05:46,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2023-11-06 21:05:46,355 INFO L87 Difference]: Start difference. First operand 53 states and 58 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 21:05:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:46,480 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2023-11-06 21:05:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:05:46,480 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 21:05:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:46,481 INFO L225 Difference]: With dead ends: 51 [2023-11-06 21:05:46,482 INFO L226 Difference]: Without dead ends: 51 [2023-11-06 21:05:46,482 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 21:05:46,483 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:05:46,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2023-11-06 21:05:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-06 21:05:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-06 21:05:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 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 21:05:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-11-06 21:05:46,489 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 28 [2023-11-06 21:05:46,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:46,489 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-11-06 21:05:46,489 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 21:05:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-11-06 21:05:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 21:05:46,491 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:46,491 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:05:46,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:05:46,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dffdca94-1f0c-456a-bf2d-9dee5e69e70d/bin/utaipan-verify-FOvIYxoinp/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 21:05:46,705 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:46,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1720787943, now seen corresponding path program 1 times [2023-11-06 21:05:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791144281] [2023-11-06 21:05:46,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:46,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:46,930 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 21:05:46,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:05:46,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791144281] [2023-11-06 21:05:46,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791144281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:05:46,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:05:46,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:05:46,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520754194] [2023-11-06 21:05:46,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:05:46,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:05:46,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:46,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:05:46,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:05:46,933 INFO L87 Difference]: Start difference. First operand 51 states and 56 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 21:05:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:47,042 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2023-11-06 21:05:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:05:47,043 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 21:05:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:47,043 INFO L225 Difference]: With dead ends: 50 [2023-11-06 21:05:47,044 INFO L226 Difference]: Without dead ends: 50 [2023-11-06 21:05:47,044 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 21:05:47,044 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:05:47,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 124 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:05:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-06 21:05:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-06 21:05:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.53125) internal successors, (49), 45 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 21:05:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-11-06 21:05:47,049 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 29 [2023-11-06 21:05:47,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:47,049 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-11-06 21:05:47,049 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 21:05:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-11-06 21:05:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-06 21:05:47,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:47,050 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:05:47,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:05:47,051 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:47,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1720787942, now seen corresponding path program 1 times [2023-11-06 21:05:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:47,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773232085] [2023-11-06 21:05:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:05:47,198 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 21:05:47,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:05:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773232085] [2023-11-06 21:05:47,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773232085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:05:47,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:05:47,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:05:47,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514151561] [2023-11-06 21:05:47,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:05:47,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:05:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:05:47,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:05:47,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:05:47,201 INFO L87 Difference]: Start difference. First operand 50 states and 55 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 21:05:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:05:47,292 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2023-11-06 21:05:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:05:47,293 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 21:05:47,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:05:47,294 INFO L225 Difference]: With dead ends: 49 [2023-11-06 21:05:47,294 INFO L226 Difference]: Without dead ends: 49 [2023-11-06 21:05:47,295 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 21:05:47,295 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:05:47,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 120 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:05:47,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-06 21:05:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-06 21:05:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.5) 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 21:05:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2023-11-06 21:05:47,303 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 29 [2023-11-06 21:05:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:05:47,303 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2023-11-06 21:05:47,303 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 21:05:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2023-11-06 21:05:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 21:05:47,304 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:05:47,305 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 21:05:47,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:05:47,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-11-06 21:05:47,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:05:47,306 INFO L85 PathProgramCache]: Analyzing trace with hash 114916214, now seen corresponding path program 1 times [2023-11-06 21:05:47,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:05:47,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571259021] [2023-11-06 21:05:47,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:05:47,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:05:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat