./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:05:18,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:05:18,775 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 20:05:18,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:05:18,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:05:18,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:05:18,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:05:18,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:05:18,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:05:18,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:05:18,814 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 20:05:18,815 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 20:05:18,815 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 20:05:18,816 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 20:05:18,816 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 20:05:18,817 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 20:05:18,817 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 20:05:18,818 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 20:05:18,818 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 20:05:18,819 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 20:05:18,819 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 20:05:18,820 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 20:05:18,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:05:18,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:05:18,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:05:18,822 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:05:18,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:05:18,823 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:05:18,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:05:18,824 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 20:05:18,824 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 20:05:18,825 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 20:05:18,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:05:18,825 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 20:05:18,825 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 20:05:18,826 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:05:18,826 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:05:18,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:05:18,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:05:18,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:05:18,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:05:18,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:05:18,827 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:05:18,828 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 20:05:18,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:05:18,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:05:18,828 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 20:05:18,828 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 20:05:18,829 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_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/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_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-12-02 20:05:19,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:05:19,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:05:19,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:05:19,103 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:05:19,103 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:05:19,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-12-02 20:05:21,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:05:22,031 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:05:22,032 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-12-02 20:05:22,045 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/data/b884a1789/964b49126bcf4815a18e166cd1765994/FLAGa5cbff55a [2023-12-02 20:05:22,055 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/data/b884a1789/964b49126bcf4815a18e166cd1765994 [2023-12-02 20:05:22,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:05:22,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:05:22,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:05:22,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:05:22,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:05:22,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20456a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22, skipping insertion in model container [2023-12-02 20:05:22,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,108 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:05:22,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:05:22,359 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:05:22,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:05:22,426 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:05:22,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22 WrapperNode [2023-12-02 20:05:22,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:05:22,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:05:22,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:05:22,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:05:22,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,475 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 148 [2023-12-02 20:05:22,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:05:22,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:05:22,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:05:22,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:05:22,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:05:22,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:05:22,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:05:22,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:05:22,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (1/1) ... [2023-12-02 20:05:22,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:05:22,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:05:22,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:05:22,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:05:22,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:05:22,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:05:22,576 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 20:05:22,576 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 20:05:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 20:05:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:05:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:05:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 20:05:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 20:05:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:05:22,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 20:05:22,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:05:22,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:05:22,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:05:22,718 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:05:22,721 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:05:23,019 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:05:23,062 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:05:23,063 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 20:05:23,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:05:23 BoogieIcfgContainer [2023-12-02 20:05:23,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:05:23,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:05:23,067 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:05:23,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:05:23,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:05:22" (1/3) ... [2023-12-02 20:05:23,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bea5b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:05:23, skipping insertion in model container [2023-12-02 20:05:23,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:05:22" (2/3) ... [2023-12-02 20:05:23,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bea5b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:05:23, skipping insertion in model container [2023-12-02 20:05:23,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:05:23" (3/3) ... [2023-12-02 20:05:23,072 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-12-02 20:05:23,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:05:23,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-12-02 20:05:23,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 20:05:23,131 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;@58da9509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:05:23,131 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-12-02 20:05:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 99 states have internal predecessors, (111), 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-12-02 20:05:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 20:05:23,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:23,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 20:05:23,141 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:23,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash 227600450, now seen corresponding path program 1 times [2023-12-02 20:05:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:23,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896497629] [2023-12-02 20:05:23,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:23,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:05:23,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:23,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896497629] [2023-12-02 20:05:23,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896497629] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:05:23,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:05:23,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:05:23,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674222195] [2023-12-02 20:05:23,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:05:23,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:05:23,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:23,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:05:23,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:05:23,394 INFO L87 Difference]: Start difference. First operand has 104 states, 49 states have (on average 2.2653061224489797) internal successors, (111), 99 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:05:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:23,516 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2023-12-02 20:05:23,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:05:23,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 20:05:23,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:23,526 INFO L225 Difference]: With dead ends: 101 [2023-12-02 20:05:23,527 INFO L226 Difference]: Without dead ends: 99 [2023-12-02 20:05:23,528 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-12-02 20:05:23,532 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:23,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 141 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 20:05:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-12-02 20:05:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-12-02 20:05:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 47 states have (on average 2.148936170212766) internal successors, (101), 94 states have internal predecessors, (101), 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-12-02 20:05:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-12-02 20:05:23,574 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 5 [2023-12-02 20:05:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:23,575 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-12-02 20:05:23,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:05:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-12-02 20:05:23,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 20:05:23,575 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:23,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 20:05:23,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:05:23,576 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:23,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:23,577 INFO L85 PathProgramCache]: Analyzing trace with hash 227600451, now seen corresponding path program 1 times [2023-12-02 20:05:23,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:23,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120443191] [2023-12-02 20:05:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:23,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:05:23,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:23,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120443191] [2023-12-02 20:05:23,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120443191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:05:23,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:05:23,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:05:23,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923738319] [2023-12-02 20:05:23,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:05:23,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:05:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:05:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:05:23,689 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:05:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:23,805 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-12-02 20:05:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:05:23,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 20:05:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:23,807 INFO L225 Difference]: With dead ends: 97 [2023-12-02 20:05:23,807 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 20:05:23,807 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-12-02 20:05:23,809 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:23,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 20:05:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 20:05:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-02 20:05:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.106382978723404) internal successors, (99), 92 states have internal predecessors, (99), 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-12-02 20:05:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-12-02 20:05:23,820 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 5 [2023-12-02 20:05:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:23,820 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-12-02 20:05:23,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:05:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-12-02 20:05:23,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 20:05:23,821 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:23,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:23,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 20:05:23,822 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:23,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:23,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1271630806, now seen corresponding path program 1 times [2023-12-02 20:05:23,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:23,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359494687] [2023-12-02 20:05:23,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:23,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:05:23,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:23,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359494687] [2023-12-02 20:05:23,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359494687] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:05:23,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:05:23,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:05:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771286140] [2023-12-02 20:05:23,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:05:23,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:05:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:05:23,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:05:23,913 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 20:05:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:23,951 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2023-12-02 20:05:23,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:05:23,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-02 20:05:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:23,954 INFO L225 Difference]: With dead ends: 98 [2023-12-02 20:05:23,954 INFO L226 Difference]: Without dead ends: 98 [2023-12-02 20:05:23,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:05:23,956 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:23,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 20:05:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-02 20:05:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-12-02 20:05:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 93 states have internal predecessors, (100), 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-12-02 20:05:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-12-02 20:05:23,966 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 10 [2023-12-02 20:05:23,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:23,968 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-12-02 20:05:23,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 20:05:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-12-02 20:05:23,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 20:05:23,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:23,969 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:23,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 20:05:23,970 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:23,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:23,971 INFO L85 PathProgramCache]: Analyzing trace with hash 310161943, now seen corresponding path program 1 times [2023-12-02 20:05:23,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:23,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749644529] [2023-12-02 20:05:23,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:23,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:05:24,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749644529] [2023-12-02 20:05:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749644529] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:05:24,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:05:24,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:05:24,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243931014] [2023-12-02 20:05:24,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:05:24,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:05:24,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:24,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:05:24,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:05:24,118 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 20:05:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:24,317 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2023-12-02 20:05:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:05:24,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-02 20:05:24,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:24,319 INFO L225 Difference]: With dead ends: 97 [2023-12-02 20:05:24,319 INFO L226 Difference]: Without dead ends: 97 [2023-12-02 20:05:24,319 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-12-02 20:05:24,320 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:24,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 282 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 20:05:24,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-02 20:05:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-02 20:05:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 48 states have (on average 2.0625) internal successors, (99), 92 states have internal predecessors, (99), 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-12-02 20:05:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-12-02 20:05:24,328 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 17 [2023-12-02 20:05:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:24,329 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-12-02 20:05:24,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 20:05:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-12-02 20:05:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 20:05:24,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:24,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:24,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 20:05:24,330 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:24,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:24,331 INFO L85 PathProgramCache]: Analyzing trace with hash 310161944, now seen corresponding path program 1 times [2023-12-02 20:05:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:24,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930886619] [2023-12-02 20:05:24,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:24,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:05:24,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930886619] [2023-12-02 20:05:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930886619] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:05:24,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:05:24,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:05:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473891974] [2023-12-02 20:05:24,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:05:24,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:05:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:24,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:05:24,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:05:24,576 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 20:05:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:24,737 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2023-12-02 20:05:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:05:24,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-02 20:05:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:24,738 INFO L225 Difference]: With dead ends: 96 [2023-12-02 20:05:24,738 INFO L226 Difference]: Without dead ends: 96 [2023-12-02 20:05:24,739 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-12-02 20:05:24,740 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:24,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 306 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 20:05:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-02 20:05:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-02 20:05:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 91 states have internal predecessors, (98), 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-12-02 20:05:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2023-12-02 20:05:24,747 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 17 [2023-12-02 20:05:24,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:24,748 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2023-12-02 20:05:24,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 20:05:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2023-12-02 20:05:24,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 20:05:24,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:24,749 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:24,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 20:05:24,749 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:24,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:24,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1713077914, now seen corresponding path program 1 times [2023-12-02 20:05:24,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:24,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364645911] [2023-12-02 20:05:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:24,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:24,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:05:24,962 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:24,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364645911] [2023-12-02 20:05:24,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364645911] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:05:24,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342037467] [2023-12-02 20:05:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:24,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:05:24,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:05:24,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:05:24,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 20:05:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:25,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 20:05:25,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:05:25,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:05:25,172 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 20:05:25,223 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 20:05:25,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 20:05:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-12-02 20:05:25,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:05:25,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342037467] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:05:25,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1828399344] [2023-12-02 20:05:25,313 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 20:05:25,314 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:05:25,317 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:05:25,321 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:05:25,321 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:05:26,632 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-12-02 20:05:26,750 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:05:28,816 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1189#(and (not (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-12-02 20:05:28,816 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:05:28,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:05:28,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2023-12-02 20:05:28,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949061907] [2023-12-02 20:05:28,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:05:28,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 20:05:28,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:28,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 20:05:28,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=433, Unknown=1, NotChecked=42, Total=552 [2023-12-02 20:05:28,818 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 20:05:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:29,125 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2023-12-02 20:05:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:05:29,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2023-12-02 20:05:29,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:29,127 INFO L225 Difference]: With dead ends: 95 [2023-12-02 20:05:29,127 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 20:05:29,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=94, Invalid=509, Unknown=1, NotChecked=46, Total=650 [2023-12-02 20:05:29,128 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:29,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 403 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 383 Invalid, 0 Unknown, 98 Unchecked, 0.2s Time] [2023-12-02 20:05:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 20:05:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-12-02 20:05:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 48 states have (on average 2.0208333333333335) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 20:05:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2023-12-02 20:05:29,135 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 19 [2023-12-02 20:05:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:29,136 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2023-12-02 20:05:29,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 20:05:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2023-12-02 20:05:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 20:05:29,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:29,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:29,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 20:05:29,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:05:29,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:29,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1713077915, now seen corresponding path program 1 times [2023-12-02 20:05:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:29,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813086642] [2023-12-02 20:05:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:29,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:05:29,706 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:29,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813086642] [2023-12-02 20:05:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813086642] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:05:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754121569] [2023-12-02 20:05:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:29,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:05:29,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:05:29,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:05:29,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:05:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:29,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 20:05:29,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:05:29,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:05:29,973 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 20:05:29,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:05:29,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:05:30,008 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:05:30,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 20:05:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 20:05:30,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:05:30,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754121569] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:05:30,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1055216181] [2023-12-02 20:05:30,149 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-12-02 20:05:30,149 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:05:30,149 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:05:30,149 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:05:30,149 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:05:30,891 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 59 for LOIs [2023-12-02 20:05:30,965 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:05:32,865 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1483#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= (select |#length| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 3) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~data#1| 1))' at error location [2023-12-02 20:05:32,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:05:32,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:05:32,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-12-02 20:05:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579530360] [2023-12-02 20:05:32,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:05:32,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 20:05:32,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:32,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 20:05:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=768, Unknown=1, NotChecked=56, Total=930 [2023-12-02 20:05:32,867 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 20:05:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:33,272 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2023-12-02 20:05:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:05:33,273 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2023-12-02 20:05:33,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:33,275 INFO L225 Difference]: With dead ends: 95 [2023-12-02 20:05:33,275 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 20:05:33,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=126, Invalid=869, Unknown=1, NotChecked=60, Total=1056 [2023-12-02 20:05:33,276 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 7 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:33,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 427 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 463 Invalid, 0 Unknown, 100 Unchecked, 0.3s Time] [2023-12-02 20:05:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 20:05:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2023-12-02 20:05:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 48 states have (on average 2.0) internal successors, (96), 89 states have internal predecessors, (96), 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-12-02 20:05:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2023-12-02 20:05:33,283 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 19 [2023-12-02 20:05:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:33,283 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2023-12-02 20:05:33,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.230769230769231) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 20:05:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2023-12-02 20:05:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 20:05:33,284 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:33,285 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:33,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:05:33,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-02 20:05:33,485 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:33,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1849628720, now seen corresponding path program 1 times [2023-12-02 20:05:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:33,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144252585] [2023-12-02 20:05:33,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:33,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:05:33,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:33,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144252585] [2023-12-02 20:05:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144252585] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:05:33,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530753512] [2023-12-02 20:05:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:33,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:05:33,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:05:33,911 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:05:33,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:05:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:34,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 20:05:34,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:05:34,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:05:34,066 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 20:05:34,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-02 20:05:34,109 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-12-02 20:05:34,129 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-02 20:05:34,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-12-02 20:05:34,226 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 20:05:34,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 20:05:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2023-12-02 20:05:34,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:05:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:05:34,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530753512] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:05:34,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [944214367] [2023-12-02 20:05:34,677 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-12-02 20:05:34,677 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:05:34,677 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:05:34,677 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:05:34,678 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:05:35,446 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 20:05:35,460 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:05:38,689 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1867#(and (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (or (and (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#length_BEFORE_CALL_59| (Array Int Int)) (|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_33| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_33| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_int_94| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 1) (<= 4 (select |v_#length_BEFORE_CALL_59| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= (select (select (store |v_#memory_$Pointer$.base_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |v_old(#memory_int)_AFTER_CALL_33| (store |v_#memory_int_94| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_94| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_33| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0)))))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_#valid_141| (Array Int Int))) (and (= (select |v_#valid_141| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_141| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1)))) (exists ((|v_#length_113| (Array Int Int))) (= (store |v_#length_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))) (= (store |v_#memory_int_90| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_90| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_91|))) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (exists ((|v_#memory_$Pointer$.offset_115| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_32| (Array Int Int)) (|v_#memory_$Pointer$.base_119| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_57| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| Int) (|v_#memory_int_BEFORE_CALL_55| (Array Int (Array Int Int))) (|v_#memory_int_94| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.offset_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select (select (store |v_#memory_$Pointer$.base_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_$Pointer$.base_119| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_sll_circular_create_#res#1.base|) (= 1 (select |v_old(#valid)_AFTER_CALL_32| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (<= 4 (select |v_#length_BEFORE_CALL_57| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|)) (= (store |v_#memory_int_94| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17| (store (select |v_#memory_int_94| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0 (select (select |v_#memory_int_BEFORE_CALL_55| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_17|) 0))) |v_#memory_int_BEFORE_CALL_55|))) (exists ((|v_#valid_141| (Array Int Int))) (and (= (select |v_#valid_141| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_141| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1)))) (exists ((|v_#length_113| (Array Int Int))) (= (store |v_#length_113| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_int_90| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))) (= (store |v_#memory_int_90| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_90| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_91| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_91|))) (exists ((|v_#memory_$Pointer$.base_115| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 20:05:38,690 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:05:38,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:05:38,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2023-12-02 20:05:38,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225167646] [2023-12-02 20:05:38,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:05:38,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 20:05:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 20:05:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1184, Unknown=11, NotChecked=70, Total=1406 [2023-12-02 20:05:38,693 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-02 20:05:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:39,071 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2023-12-02 20:05:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:05:39,072 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 27 [2023-12-02 20:05:39,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:39,073 INFO L225 Difference]: With dead ends: 103 [2023-12-02 20:05:39,073 INFO L226 Difference]: Without dead ends: 103 [2023-12-02 20:05:39,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=178, Invalid=1375, Unknown=11, NotChecked=76, Total=1640 [2023-12-02 20:05:39,075 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 182 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:39,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 261 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 414 Invalid, 0 Unknown, 107 Unchecked, 0.3s Time] [2023-12-02 20:05:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-02 20:05:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2023-12-02 20:05:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.8333333333333333) internal successors, (88), 81 states have internal predecessors, (88), 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-12-02 20:05:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-12-02 20:05:39,081 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 27 [2023-12-02 20:05:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:39,081 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-12-02 20:05:39,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-12-02 20:05:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-12-02 20:05:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 20:05:39,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:39,082 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:39,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:05:39,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:05:39,289 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:39,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1849628719, now seen corresponding path program 1 times [2023-12-02 20:05:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:39,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765288483] [2023-12-02 20:05:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 20:05:39,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:39,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765288483] [2023-12-02 20:05:39,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765288483] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:05:39,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228854541] [2023-12-02 20:05:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:39,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:05:39,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:05:39,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:05:39,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:05:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:39,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 20:05:39,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:05:39,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 20:05:39,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:05:39,912 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-12-02 20:05:39,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:05:39,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 20:05:39,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:05:39,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:05:39,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 20:05:40,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:05:40,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:05:40,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 20:05:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 20:05:40,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:05:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228854541] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:05:40,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:05:40,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-02 20:05:40,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434263445] [2023-12-02 20:05:40,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:05:40,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:05:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:40,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:05:40,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2023-12-02 20:05:40,054 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 20:05:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:40,190 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-12-02 20:05:40,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:05:40,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-12-02 20:05:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:40,191 INFO L225 Difference]: With dead ends: 81 [2023-12-02 20:05:40,191 INFO L226 Difference]: Without dead ends: 81 [2023-12-02 20:05:40,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2023-12-02 20:05:40,192 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 25 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:40,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 180 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 110 Unchecked, 0.1s Time] [2023-12-02 20:05:40,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-02 20:05:40,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-02 20:05:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 76 states have internal predecessors, (83), 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-12-02 20:05:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-12-02 20:05:40,197 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 27 [2023-12-02 20:05:40,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:40,197 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-12-02 20:05:40,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 20:05:40,198 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-12-02 20:05:40,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 20:05:40,199 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:40,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:40,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:05:40,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:05:40,405 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:40,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:40,405 INFO L85 PathProgramCache]: Analyzing trace with hash 623260817, now seen corresponding path program 1 times [2023-12-02 20:05:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:40,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115197397] [2023-12-02 20:05:40,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:40,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 20:05:40,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:40,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115197397] [2023-12-02 20:05:40,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115197397] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:05:40,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:05:40,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:05:40,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142458025] [2023-12-02 20:05:40,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:05:40,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:05:40,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:40,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:05:40,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:05:40,503 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 20:05:40,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:40,630 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2023-12-02 20:05:40,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:05:40,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2023-12-02 20:05:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:40,631 INFO L225 Difference]: With dead ends: 79 [2023-12-02 20:05:40,631 INFO L226 Difference]: Without dead ends: 79 [2023-12-02 20:05:40,631 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-12-02 20:05:40,632 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 22 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:40,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 212 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 20:05:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-02 20:05:40,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-02 20:05:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.6875) internal successors, (81), 74 states have internal predecessors, (81), 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-12-02 20:05:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2023-12-02 20:05:40,636 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 29 [2023-12-02 20:05:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:40,636 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2023-12-02 20:05:40,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 20:05:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2023-12-02 20:05:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 20:05:40,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:40,637 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:40,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 20:05:40,638 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:40,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash 623260818, now seen corresponding path program 1 times [2023-12-02 20:05:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:40,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738231609] [2023-12-02 20:05:40,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:40,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 20:05:40,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738231609] [2023-12-02 20:05:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738231609] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:05:40,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:05:40,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 20:05:40,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273595841] [2023-12-02 20:05:40,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:05:40,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:05:40,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:40,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:05:40,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:05:40,816 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 20:05:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:40,950 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-12-02 20:05:40,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:05:40,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2023-12-02 20:05:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:40,952 INFO L225 Difference]: With dead ends: 77 [2023-12-02 20:05:40,952 INFO L226 Difference]: Without dead ends: 77 [2023-12-02 20:05:40,952 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-12-02 20:05:40,953 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 19 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:40,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 224 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 20:05:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-02 20:05:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-02 20:05:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 72 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 20:05:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2023-12-02 20:05:40,956 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 29 [2023-12-02 20:05:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:40,957 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2023-12-02 20:05:40,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 20:05:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2023-12-02 20:05:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 20:05:40,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:40,958 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:40,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 20:05:40,958 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:40,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:40,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2141229217, now seen corresponding path program 1 times [2023-12-02 20:05:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:40,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779652251] [2023-12-02 20:05:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:05:41,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:41,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779652251] [2023-12-02 20:05:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779652251] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:05:41,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861661398] [2023-12-02 20:05:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:41,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:05:41,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:05:41,521 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:05:41,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:05:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:41,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 20:05:41,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:05:41,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:05:41,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-12-02 20:05:41,893 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-12-02 20:05:41,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:05:41,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 20:05:41,914 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-02 20:05:41,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 20:05:41,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 20:05:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 20:05:41,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:05:44,058 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_708 (Array Int Int)) (|v_node_create_~temp~0#1.base_35| Int)) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_35| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_35| v_ArrVal_708) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) 1) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_35| 1)))) is different from false [2023-12-02 20:05:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861661398] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:05:44,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [274449435] [2023-12-02 20:05:44,062 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 20:05:44,062 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:05:44,063 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:05:44,063 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:05:44,063 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:05:44,997 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 20:05:45,012 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:05:50,528 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2789#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) 1)) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (or (and (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_#length_124| (Array Int Int))) (= |#length| (store |v_#length_124| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_127| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_127| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_old(#length)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int))) (|v_#memory_int_106| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_49| (Array Int Int)) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_131| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_131| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_old(#length)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= (store |v_#memory_int_106| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_106| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_BEFORE_CALL_80| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0))) |v_#memory_int_BEFORE_CALL_80|) (= (select |v_old(#valid)_AFTER_CALL_49| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))) (= (store |v_#memory_int_102| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_102| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_103|))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_152| (Array Int Int))) (and (= (store |v_#valid_152| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_152| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_#length_124| (Array Int Int))) (= |#length| (store |v_#length_124| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8))) (exists ((|v_#memory_$Pointer$.base_131| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_131| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_127| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_127| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (exists ((|v_#memory_int_106| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_48| (Array Int Int)) (|v_#memory_$Pointer$.offset_131| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_86| (Array Int Int)) (|v_#memory_$Pointer$.base_135| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_78| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| Int)) (and (= (select (select (store |v_#memory_$Pointer$.offset_131| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.offset_131| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_48| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 1) (<= 4 (select |v_#length_BEFORE_CALL_86| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|)) (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_$Pointer$.base_135| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= |v_#memory_int_BEFORE_CALL_78| (store |v_#memory_int_106| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18| (store (select |v_#memory_int_106| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0 (select (select |v_#memory_int_BEFORE_CALL_78| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_18|) 0)))))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_102| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))) (= (store |v_#memory_int_102| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_102| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_103| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) |v_#memory_int_103|))) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_152| (Array Int Int))) (and (= (store |v_#valid_152| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_152| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 20:05:50,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:05:50,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:05:50,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2023-12-02 20:05:50,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159651235] [2023-12-02 20:05:50,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:05:50,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 20:05:50,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:05:50,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 20:05:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1428, Unknown=8, NotChecked=154, Total=1722 [2023-12-02 20:05:50,530 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 23 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 20 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 20:05:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:05:51,262 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-12-02 20:05:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:05:51,263 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 20 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-12-02 20:05:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:05:51,264 INFO L225 Difference]: With dead ends: 80 [2023-12-02 20:05:51,264 INFO L226 Difference]: Without dead ends: 80 [2023-12-02 20:05:51,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=187, Invalid=1973, Unknown=10, NotChecked=182, Total=2352 [2023-12-02 20:05:51,265 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 123 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 20:05:51,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 440 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 756 Invalid, 0 Unknown, 88 Unchecked, 0.5s Time] [2023-12-02 20:05:51,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-02 20:05:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2023-12-02 20:05:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 20:05:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-12-02 20:05:51,268 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 30 [2023-12-02 20:05:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:05:51,268 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-12-02 20:05:51,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 20 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 20:05:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-12-02 20:05:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 20:05:51,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:05:51,269 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:05:51,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:05:51,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:05:51,469 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:05:51,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:05:51,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2141229218, now seen corresponding path program 1 times [2023-12-02 20:05:51,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:05:51,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974321650] [2023-12-02 20:05:51,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:51,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:05:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:05:52,345 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:05:52,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974321650] [2023-12-02 20:05:52,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974321650] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:05:52,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051227564] [2023-12-02 20:05:52,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:05:52,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:05:52,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:05:52,347 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:05:52,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:05:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:05:52,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 20:05:52,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:05:52,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:05:52,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:05:52,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:05:52,942 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 20:05:52,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:05:52,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 20:05:52,971 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 20:05:52,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-02 20:05:52,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 20:05:52,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:05:52,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:05:53,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-02 20:05:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 20:05:53,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:05:53,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051227564] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:05:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2093154911] [2023-12-02 20:05:53,332 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 20:05:53,332 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:05:53,333 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:05:53,333 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:05:53,333 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:05:54,139 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 20:05:54,153 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:06:00,443 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3113#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0))) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (or (and (exists ((|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int)))) (and (= |v_#memory_int_115| (store |v_#memory_int_114| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_114| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))))) (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_162| (Array Int Int))) (and (= (store |v_#valid_162| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_162| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_#length_134| (Array Int Int))) (= (store |v_#length_134| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (exists ((|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_62| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_old(#memory_int)_AFTER_CALL_62| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_62| (Array Int Int)) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (<= 4 (select |v_old(#length)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= (select (select (store |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (= (select |v_old(#valid)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (= |v_old(#memory_int)_AFTER_CALL_62| (store |v_#memory_int_118| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_118| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_62| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))))) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|)) (and (exists ((|v_#memory_int_114| (Array Int (Array Int Int))) (|v_#memory_int_115| (Array Int (Array Int Int)))) (and (= |v_#memory_int_115| (store |v_#memory_int_114| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_114| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 (select (select |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select |v_#memory_int_115| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4 1))))) (exists ((|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_147| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))) |#memory_$Pointer$.base|)) (exists ((|v_#valid_162| (Array Int Int))) (and (= (store |v_#valid_162| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_162| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_61| (Array Int Int)) (|v_#memory_int_118| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_151| (Array Int (Array Int Int))) (|v_#length_BEFORE_CALL_111| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| Int) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_101| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.base_151| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (select |v_old(#valid)_AFTER_CALL_61| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 1) (= (select (select (store |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0) (<= 4 (select |v_#length_BEFORE_CALL_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|)) (= |v_#memory_int_BEFORE_CALL_101| (store |v_#memory_int_118| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19| (store (select |v_#memory_int_118| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0 (select (select |v_#memory_int_BEFORE_CALL_101| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_19|) 0)))))) (exists ((|v_#length_134| (Array Int Int))) (= (store |v_#length_134| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 8) |#length|)) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_143| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_143| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0 0) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4))))) (<= (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 1) |#StackHeapBarrier|))) (or (< |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~head#1.base|) 1))' at error location [2023-12-02 20:06:00,443 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:06:00,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:06:00,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-02 20:06:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076705991] [2023-12-02 20:06:00,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:06:00,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 20:06:00,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:06:00,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 20:06:00,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2096, Unknown=11, NotChecked=92, Total=2352 [2023-12-02 20:06:00,445 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 24 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 20:06:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:01,766 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2023-12-02 20:06:01,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 20:06:01,767 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 24 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 30 [2023-12-02 20:06:01,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:01,768 INFO L225 Difference]: With dead ends: 85 [2023-12-02 20:06:01,768 INFO L226 Difference]: Without dead ends: 85 [2023-12-02 20:06:01,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=253, Invalid=3276, Unknown=15, NotChecked=116, Total=3660 [2023-12-02 20:06:01,770 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 134 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 1107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:01,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 665 Invalid, 1107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1002 Invalid, 0 Unknown, 94 Unchecked, 0.7s Time] [2023-12-02 20:06:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-02 20:06:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2023-12-02 20:06:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 75 states have internal predecessors, (83), 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-12-02 20:06:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2023-12-02 20:06:01,774 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 30 [2023-12-02 20:06:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:01,775 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2023-12-02 20:06:01,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 24 states have internal predecessors, (44), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 20:06:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2023-12-02 20:06:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 20:06:01,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:01,776 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:01,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-02 20:06:01,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:06:01,976 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:06:01,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash 419389915, now seen corresponding path program 1 times [2023-12-02 20:06:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:06:01,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742217643] [2023-12-02 20:06:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:06:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-02 20:06:02,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:06:02,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742217643] [2023-12-02 20:06:02,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742217643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:06:02,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:06:02,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 20:06:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706460607] [2023-12-02 20:06:02,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:06:02,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:06:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:06:02,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:06:02,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:06:02,167 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 20:06:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:02,254 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2023-12-02 20:06:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:06:02,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-12-02 20:06:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:02,255 INFO L225 Difference]: With dead ends: 77 [2023-12-02 20:06:02,255 INFO L226 Difference]: Without dead ends: 77 [2023-12-02 20:06:02,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-12-02 20:06:02,256 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 128 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:02,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 122 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 20:06:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-02 20:06:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-02 20:06:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.509433962264151) internal successors, (80), 72 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 20:06:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2023-12-02 20:06:02,259 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 32 [2023-12-02 20:06:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:02,260 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2023-12-02 20:06:02,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 20:06:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2023-12-02 20:06:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 20:06:02,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:02,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:02,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 20:06:02,261 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:06:02,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash 116189350, now seen corresponding path program 1 times [2023-12-02 20:06:02,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:06:02,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989632632] [2023-12-02 20:06:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:06:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 20:06:02,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:06:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989632632] [2023-12-02 20:06:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989632632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:06:02,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:06:02,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 20:06:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093200735] [2023-12-02 20:06:02,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:06:02,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 20:06:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:06:02,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 20:06:02,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 20:06:02,503 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 9 states, 6 states have (on average 3.5) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 20:06:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:02,723 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2023-12-02 20:06:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 20:06:02,724 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.5) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-12-02 20:06:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:02,725 INFO L225 Difference]: With dead ends: 123 [2023-12-02 20:06:02,725 INFO L226 Difference]: Without dead ends: 123 [2023-12-02 20:06:02,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-02 20:06:02,726 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 73 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:02,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 277 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 20:06:02,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-12-02 20:06:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 79. [2023-12-02 20:06:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 74 states have internal predecessors, (83), 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-12-02 20:06:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-12-02 20:06:02,730 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 33 [2023-12-02 20:06:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:02,730 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-12-02 20:06:02,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.5) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 20:06:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-12-02 20:06:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 20:06:02,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:02,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:02,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 20:06:02,732 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:06:02,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:02,733 INFO L85 PathProgramCache]: Analyzing trace with hash 116189351, now seen corresponding path program 1 times [2023-12-02 20:06:02,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:06:02,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118123549] [2023-12-02 20:06:02,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:02,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:06:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 20:06:03,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:06:03,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118123549] [2023-12-02 20:06:03,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118123549] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:06:03,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:06:03,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 20:06:03,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257877502] [2023-12-02 20:06:03,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:06:03,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 20:06:03,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:06:03,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 20:06:03,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 20:06:03,120 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 20:06:03,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:03,306 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2023-12-02 20:06:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:06:03,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-12-02 20:06:03,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:03,307 INFO L225 Difference]: With dead ends: 120 [2023-12-02 20:06:03,307 INFO L226 Difference]: Without dead ends: 120 [2023-12-02 20:06:03,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-12-02 20:06:03,308 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 68 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:03,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 311 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 20:06:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-02 20:06:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 81. [2023-12-02 20:06:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 76 states have internal predecessors, (85), 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-12-02 20:06:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2023-12-02 20:06:03,311 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 33 [2023-12-02 20:06:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:03,311 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2023-12-02 20:06:03,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 20:06:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2023-12-02 20:06:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 20:06:03,312 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:03,312 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:03,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 20:06:03,313 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:06:03,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1514030445, now seen corresponding path program 1 times [2023-12-02 20:06:03,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:06:03,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238461342] [2023-12-02 20:06:03,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:03,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:06:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:04,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:04,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:06:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238461342] [2023-12-02 20:06:04,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238461342] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:06:04,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196489128] [2023-12-02 20:06:04,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:04,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:06:04,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:06:04,486 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:06:04,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 20:06:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:04,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 87 conjunts are in the unsatisfiable core [2023-12-02 20:06:04,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:04,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:06:04,837 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 20:06:04,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 20:06:04,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:05,039 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 20:06:05,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 41 [2023-12-02 20:06:05,096 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:06:05,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-12-02 20:06:05,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-12-02 20:06:05,214 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 20:06:05,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:05,241 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 20:06:05,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2023-12-02 20:06:05,277 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-12-02 20:06:05,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2023-12-02 20:06:05,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:05,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 20:06:05,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 20:06:05,508 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:06:05,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2023-12-02 20:06:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:06:05,550 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:05,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196489128] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:06:05,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [650184292] [2023-12-02 20:06:05,771 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 20:06:05,771 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:06:05,771 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:06:05,772 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:06:05,772 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:06:07,144 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 20:06:07,157 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:06:11,923 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4085#(and (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) 1)) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 20:06:11,923 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:06:11,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:06:11,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2023-12-02 20:06:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247348460] [2023-12-02 20:06:11,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:06:11,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 20:06:11,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:06:11,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 20:06:11,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3209, Unknown=8, NotChecked=114, Total=3540 [2023-12-02 20:06:11,926 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 37 states, 27 states have (on average 1.962962962962963) internal successors, (53), 31 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 20:06:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:13,361 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2023-12-02 20:06:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:06:13,362 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 27 states have (on average 1.962962962962963) internal successors, (53), 31 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-02 20:06:13,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:13,362 INFO L225 Difference]: With dead ends: 114 [2023-12-02 20:06:13,362 INFO L226 Difference]: Without dead ends: 114 [2023-12-02 20:06:13,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=337, Invalid=4489, Unknown=8, NotChecked=136, Total=4970 [2023-12-02 20:06:13,364 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 162 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:13,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 744 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1286 Invalid, 0 Unknown, 118 Unchecked, 0.9s Time] [2023-12-02 20:06:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-02 20:06:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2023-12-02 20:06:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 89 states have internal predecessors, (102), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 20:06:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2023-12-02 20:06:13,368 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 34 [2023-12-02 20:06:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:13,368 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2023-12-02 20:06:13,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 27 states have (on average 1.962962962962963) internal successors, (53), 31 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 20:06:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2023-12-02 20:06:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 20:06:13,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:13,369 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:13,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 20:06:13,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 20:06:13,569 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:06:13,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1514030444, now seen corresponding path program 1 times [2023-12-02 20:06:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:06:13,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394351353] [2023-12-02 20:06:13,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:13,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:06:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:06:14,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:06:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394351353] [2023-12-02 20:06:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394351353] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:06:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057881326] [2023-12-02 20:06:14,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:14,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:06:14,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:06:14,804 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:06:14,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:06:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:14,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 110 conjunts are in the unsatisfiable core [2023-12-02 20:06:14,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:14,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:06:15,215 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 20:06:15,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 20:06:15,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:15,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:06:15,452 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-12-02 20:06:15,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 60 [2023-12-02 20:06:15,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2023-12-02 20:06:15,529 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:06:15,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2023-12-02 20:06:15,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 20:06:15,666 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.offset| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 20:06:15,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:15,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-12-02 20:06:15,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:15,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:15,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:15,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 20:06:15,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:15,703 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 20:06:15,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 54 [2023-12-02 20:06:15,722 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 20:06:15,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 20:06:16,022 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:06:16,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 27 [2023-12-02 20:06:16,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 20:06:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 20:06:16,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:16,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057881326] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:06:16,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [706335887] [2023-12-02 20:06:16,501 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2023-12-02 20:06:16,501 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:06:16,501 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:06:16,501 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:06:16,501 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:06:17,613 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 20:06:17,625 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:06:23,068 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4514#(and (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| 1) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_~head#1.base|) (= |ULTIMATE.start_sll_circular_append_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (or (< |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (< (select |#length| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) (+ |ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 20:06:23,068 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 20:06:23,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:06:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2023-12-02 20:06:23,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460432963] [2023-12-02 20:06:23,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 20:06:23,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-02 20:06:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:06:23,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-02 20:06:23,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=4180, Unknown=11, NotChecked=130, Total=4556 [2023-12-02 20:06:23,071 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 43 states, 32 states have (on average 1.75) internal successors, (56), 35 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 20:06:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:06:25,189 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2023-12-02 20:06:25,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 20:06:25,189 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 32 states have (on average 1.75) internal successors, (56), 35 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-12-02 20:06:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:06:25,190 INFO L225 Difference]: With dead ends: 118 [2023-12-02 20:06:25,190 INFO L226 Difference]: Without dead ends: 118 [2023-12-02 20:06:25,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1923 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=389, Invalid=6083, Unknown=12, NotChecked=158, Total=6642 [2023-12-02 20:06:25,193 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 291 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 20:06:25,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 913 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1584 Invalid, 0 Unknown, 123 Unchecked, 1.2s Time] [2023-12-02 20:06:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-02 20:06:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2023-12-02 20:06:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 88 states have internal predecessors, (100), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 20:06:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2023-12-02 20:06:25,196 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 34 [2023-12-02 20:06:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:06:25,196 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2023-12-02 20:06:25,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 32 states have (on average 1.75) internal successors, (56), 35 states have internal predecessors, (56), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-02 20:06:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2023-12-02 20:06:25,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 20:06:25,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:06:25,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:06:25,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-02 20:06:25,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 20:06:25,398 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:06:25,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:06:25,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2138814026, now seen corresponding path program 1 times [2023-12-02 20:06:25,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:06:25,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781485660] [2023-12-02 20:06:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:25,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:06:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:06:25,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:06:25,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781485660] [2023-12-02 20:06:25,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781485660] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:06:25,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491440724] [2023-12-02 20:06:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:06:25,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:06:25,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:06:25,740 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:06:25,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 20:06:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:06:25,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-02 20:06:25,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:06:26,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:06:26,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:06:26,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-12-02 20:06:26,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 20:06:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:06:26,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:06:26,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491440724] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:06:26,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [526143801] [2023-12-02 20:06:26,203 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 20:06:26,203 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:06:26,204 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:06:26,204 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:06:26,204 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:06:27,287 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 20:06:27,299 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:07:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [526143801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:07:08,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:07:08,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [15, 16] total 45 [2023-12-02 20:07:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931665672] [2023-12-02 20:07:08,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:07:08,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 20:07:08,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:07:08,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 20:07:08,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1995, Unknown=20, NotChecked=0, Total=2162 [2023-12-02 20:07:08,374 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 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-12-02 20:07:11,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:13,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:16,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:18,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:20,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:22,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:24,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:26,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:28,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:30,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:33,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:35,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:37,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:39,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:42,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:44,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:47,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:49,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:51,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:52,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:07:54,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:09:04,559 WARN L293 SmtUtils]: Spent 53.49s on a formula simplification. DAG size of input: 180 DAG size of output: 179 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:09:07,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:09:14,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:10:16,426 WARN L293 SmtUtils]: Spent 43.83s on a formula simplification. DAG size of input: 185 DAG size of output: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:10:33,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:10:35,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:10:40,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:10:47,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:10:50,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:10:54,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:11:01,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:11:05,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:11:07,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:11:09,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:11:11,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:11:15,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:11:17,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:11:20,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:11:24,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:11:24,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:11:24,997 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2023-12-02 20:11:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:11:24,998 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 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) Word has length 37 [2023-12-02 20:11:24,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:11:24,999 INFO L225 Difference]: With dead ends: 120 [2023-12-02 20:11:24,999 INFO L226 Difference]: Without dead ends: 120 [2023-12-02 20:11:25,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 171.9s TimeCoverageRelationStatistics Valid=156, Invalid=2170, Unknown=26, NotChecked=0, Total=2352 [2023-12-02 20:11:25,001 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 53 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 3 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 124.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126.1s IncrementalHoareTripleChecker+Time [2023-12-02 20:11:25,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 272 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1150 Invalid, 40 Unknown, 0 Unchecked, 126.1s Time] [2023-12-02 20:11:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-02 20:11:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 85. [2023-12-02 20:11:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 80 states have internal predecessors, (88), 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-12-02 20:11:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2023-12-02 20:11:25,006 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 37 [2023-12-02 20:11:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:11:25,006 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2023-12-02 20:11:25,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 18 states have internal predecessors, (23), 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-12-02 20:11:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2023-12-02 20:11:25,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 20:11:25,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:11:25,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:11:25,013 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 20:11:25,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:11:25,208 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:11:25,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:11:25,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1881729636, now seen corresponding path program 1 times [2023-12-02 20:11:25,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:11:25,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929313243] [2023-12-02 20:11:25,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:11:25,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:11:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:11:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:11:25,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:11:25,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929313243] [2023-12-02 20:11:25,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929313243] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:11:25,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599384654] [2023-12-02 20:11:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:11:25,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:11:25,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:11:25,951 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:11:25,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 20:11:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:11:26,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-02 20:11:26,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:11:26,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:11:26,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:11:26,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:11:26,357 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-12-02 20:11:26,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2023-12-02 20:11:26,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 20:11:26,467 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:11:26,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 15 [2023-12-02 20:11:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 20:11:26,491 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:11:26,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2023-12-02 20:11:26,974 INFO L349 Elim1Store]: treesize reduction 11, result has 82.0 percent of original size [2023-12-02 20:11:26,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 637 treesize of output 614 [2023-12-02 20:11:27,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:11:27,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2023-12-02 20:11:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 20:11:30,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599384654] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:11:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1847506783] [2023-12-02 20:11:30,057 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2023-12-02 20:11:30,057 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:11:30,057 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:11:30,057 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:11:30,057 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:11:31,842 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 20:11:31,857 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:12:21,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1847506783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:12:21,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:12:21,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [21, 11, 10] total 62 [2023-12-02 20:12:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322457371] [2023-12-02 20:12:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:12:21,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 20:12:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:12:21,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 20:12:21,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=3483, Unknown=25, NotChecked=0, Total=3782 [2023-12-02 20:12:21,151 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-12-02 20:12:25,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:27,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:29,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:31,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:34,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:36,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:39,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:41,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:43,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:46,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:48,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:51,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:12:54,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:14:06,616 WARN L293 SmtUtils]: Spent 56.03s on a formula simplification. DAG size of input: 180 DAG size of output: 179 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:14:13,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:14:17,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:15:33,690 WARN L293 SmtUtils]: Spent 57.43s on a formula simplification. DAG size of input: 185 DAG size of output: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:15:39,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:15:51,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:17:05,222 WARN L293 SmtUtils]: Spent 53.08s on a formula simplification. DAG size of input: 184 DAG size of output: 183 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:17:12,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:18:19,752 WARN L293 SmtUtils]: Spent 46.83s on a formula simplification. DAG size of input: 188 DAG size of output: 187 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 20:18:26,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:18:31,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:18:41,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:18:43,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:18:48,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:18:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 20:18:55,564 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2023-12-02 20:18:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 20:18:55,565 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) Word has length 38 [2023-12-02 20:18:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 20:18:55,566 INFO L225 Difference]: With dead ends: 92 [2023-12-02 20:18:55,566 INFO L226 Difference]: Without dead ends: 92 [2023-12-02 20:18:55,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 325.3s TimeCoverageRelationStatistics Valid=323, Invalid=3934, Unknown=33, NotChecked=0, Total=4290 [2023-12-02 20:18:55,568 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 4 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 119.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 121.4s IncrementalHoareTripleChecker+Time [2023-12-02 20:18:55,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 353 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1236 Invalid, 41 Unknown, 0 Unchecked, 121.4s Time] [2023-12-02 20:18:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-02 20:18:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2023-12-02 20:18:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.4) internal successors, (91), 83 states have internal predecessors, (91), 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-12-02 20:18:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2023-12-02 20:18:55,571 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 38 [2023-12-02 20:18:55,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 20:18:55,571 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2023-12-02 20:18:55,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-12-02 20:18:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2023-12-02 20:18:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 20:18:55,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 20:18:55,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 20:18:55,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 20:18:55,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:18:55,773 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-12-02 20:18:55,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:18:55,773 INFO L85 PathProgramCache]: Analyzing trace with hash -628188746, now seen corresponding path program 1 times [2023-12-02 20:18:55,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 20:18:55,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614531441] [2023-12-02 20:18:55,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:18:55,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:18:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:18:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:18:56,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 20:18:56,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614531441] [2023-12-02 20:18:56,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614531441] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:18:56,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201219977] [2023-12-02 20:18:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:18:56,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:18:56,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 20:18:56,857 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:18:56,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b97bb048-e5d9-4fcf-acff-64322af6bdf8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 20:18:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:18:57,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-02 20:18:57,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:18:57,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 20:18:57,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:18:57,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-02 20:18:57,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:18:57,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 20:18:57,581 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-12-02 20:18:57,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2023-12-02 20:18:57,904 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 20:18:57,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2023-12-02 20:18:57,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:18:57,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-02 20:18:58,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-02 20:18:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 20:18:58,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:18:58,494 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1743 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| Int) (v_ArrVal_1737 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| 1)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| 1) (select (select (store (store |c_#memory_$Pointer$.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| v_ArrVal_1743) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_1736) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| v_ArrVal_1737) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1))) is different from false [2023-12-02 20:18:58,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201219977] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:18:58,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1205420246] [2023-12-02 20:18:58,498 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2023-12-02 20:18:58,498 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 20:18:58,498 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 20:18:58,498 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 20:18:58,498 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 20:18:59,985 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 6 for LOIs [2023-12-02 20:19:00,000 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 20:19:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1205420246] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:19:46,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 20:19:46,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [22, 18] total 62 [2023-12-02 20:19:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251973118] [2023-12-02 20:19:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:19:46,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 20:19:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 20:19:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 20:19:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=4162, Unknown=37, NotChecked=130, Total=4556 [2023-12-02 20:19:46,593 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-12-02 20:19:50,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:19:54,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:19:56,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:19:58,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:20:00,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:20:02,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:20:05,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:20:07,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:20:09,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:20:11,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:20:13,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:20:15,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]