./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/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_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/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_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:23:25,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:23:25,853 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 08:23:25,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:23:25,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:23:25,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:23:25,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:23:25,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:23:25,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:23:25,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:23:25,880 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:23:25,881 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:23:25,881 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:23:25,882 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:23:25,882 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:23:25,883 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:23:25,883 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:23:25,884 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:23:25,884 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:23:25,885 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:23:25,885 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:23:25,886 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:23:25,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 08:23:25,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 08:23:25,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:23:25,888 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:23:25,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:23:25,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:23:25,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:23:25,890 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 08:23:25,890 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 08:23:25,891 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 08:23:25,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:23:25,891 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 08:23:25,892 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 08:23:25,892 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:23:25,892 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:23:25,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:23:25,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:23:25,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:23:25,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:23:25,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:23:25,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:23:25,893 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:23:25,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:23:25,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:23:25,894 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:23:25,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:23:25,894 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_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/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_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2023-12-02 08:23:26,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:23:26,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:23:26,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:23:26,126 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:23:26,127 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:23:26,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2023-12-02 08:23:28,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:23:29,216 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:23:29,216 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2023-12-02 08:23:29,231 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/data/314673c10/cd44b4f038134ae395b52f833d741754/FLAG09e99ac44 [2023-12-02 08:23:29,245 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/data/314673c10/cd44b4f038134ae395b52f833d741754 [2023-12-02 08:23:29,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:23:29,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:23:29,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:23:29,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:23:29,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:23:29,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf2b1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29, skipping insertion in model container [2023-12-02 08:23:29,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,302 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:23:29,590 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:23:29,601 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:23:29,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:23:29,681 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:23:29,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29 WrapperNode [2023-12-02 08:23:29,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:23:29,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:23:29,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:23:29,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:23:29,691 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:23:29" (1/1) ... [2023-12-02 08:23:29,705 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:23:29" (1/1) ... [2023-12-02 08:23:29,730 INFO L138 Inliner]: procedures = 127, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 146 [2023-12-02 08:23:29,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:23:29,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:23:29,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:23:29,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:23:29,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:23:29,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:23:29,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:23:29,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:23:29,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29" (1/1) ... [2023-12-02 08:23:29,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:23:29,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:23:29,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:23:29,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:23:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 08:23:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 08:23:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-12-02 08:23:29,821 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-12-02 08:23:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 08:23:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:23:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 08:23:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 08:23:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 08:23:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 08:23:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-12-02 08:23:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 08:23:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:23:29,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:23:29,943 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:23:29,945 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:23:30,285 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:23:30,355 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:23:30,355 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-02 08:23:30,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:23:30 BoogieIcfgContainer [2023-12-02 08:23:30,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:23:30,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:23:30,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:23:30,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:23:30,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:23:29" (1/3) ... [2023-12-02 08:23:30,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544b255a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:23:30, skipping insertion in model container [2023-12-02 08:23:30,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:23:29" (2/3) ... [2023-12-02 08:23:30,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544b255a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:23:30, skipping insertion in model container [2023-12-02 08:23:30,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:23:30" (3/3) ... [2023-12-02 08:23:30,366 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2023-12-02 08:23:30,382 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:23:30,382 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2023-12-02 08:23:30,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:23:30,428 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;@2ffbd086, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:23:30,428 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2023-12-02 08:23:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 47 states have (on average 2.297872340425532) internal successors, (108), 94 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:23:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 08:23:30,441 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:23:30,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 08:23:30,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:23:30,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:23:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1602042251, now seen corresponding path program 1 times [2023-12-02 08:23:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:23:30,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547859263] [2023-12-02 08:23:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:23:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:30,698 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 08:23:30,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:23:30,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547859263] [2023-12-02 08:23:30,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547859263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:23:30,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:23:30,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:23:30,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016549971] [2023-12-02 08:23:30,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:23:30,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:23:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:23:30,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:23:30,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:23:30,735 INFO L87 Difference]: Start difference. First operand has 98 states, 47 states have (on average 2.297872340425532) internal successors, (108), 94 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:23:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:23:30,803 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2023-12-02 08:23:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:23:30,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 08:23:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:23:30,813 INFO L225 Difference]: With dead ends: 111 [2023-12-02 08:23:30,813 INFO L226 Difference]: Without dead ends: 109 [2023-12-02 08:23:30,815 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 08:23:30,818 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 13 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:23:30,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 186 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:23:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-02 08:23:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2023-12-02 08:23:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 46 states have (on average 2.1956521739130435) internal successors, (101), 92 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:23:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2023-12-02 08:23:30,855 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 6 [2023-12-02 08:23:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:23:30,855 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2023-12-02 08:23:30,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:23:30,856 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2023-12-02 08:23:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 08:23:30,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:23:30,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 08:23:30,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 08:23:30,857 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:23:30,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:23:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1788653075, now seen corresponding path program 1 times [2023-12-02 08:23:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:23:30,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635447660] [2023-12-02 08:23:30,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:30,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:23:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:30,926 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 08:23:30,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:23:30,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635447660] [2023-12-02 08:23:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635447660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:23:30,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:23:30,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:23:30,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772271408] [2023-12-02 08:23:30,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:23:30,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:23:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:23:30,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:23:30,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:23:30,929 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:23:31,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:23:31,032 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2023-12-02 08:23:31,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:23:31,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 08:23:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:23:31,034 INFO L225 Difference]: With dead ends: 93 [2023-12-02 08:23:31,034 INFO L226 Difference]: Without dead ends: 93 [2023-12-02 08:23:31,034 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 08:23:31,036 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:23:31,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:23:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-02 08:23:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-02 08:23:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 46 states have (on average 2.130434782608696) internal successors, (98), 89 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:23:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2023-12-02 08:23:31,046 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 6 [2023-12-02 08:23:31,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:23:31,047 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2023-12-02 08:23:31,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:23:31,047 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2023-12-02 08:23:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 08:23:31,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:23:31,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 08:23:31,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 08:23:31,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:23:31,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:23:31,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1788653074, now seen corresponding path program 1 times [2023-12-02 08:23:31,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:23:31,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188602382] [2023-12-02 08:23:31,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:31,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:23:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:31,141 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 08:23:31,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:23:31,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188602382] [2023-12-02 08:23:31,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188602382] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:23:31,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:23:31,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 08:23:31,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450241048] [2023-12-02 08:23:31,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:23:31,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:23:31,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:23:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:23:31,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:23:31,144 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:23:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:23:31,235 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2023-12-02 08:23:31,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:23:31,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 08:23:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:23:31,237 INFO L225 Difference]: With dead ends: 90 [2023-12-02 08:23:31,237 INFO L226 Difference]: Without dead ends: 90 [2023-12-02 08:23:31,238 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 08:23:31,239 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:23:31,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 136 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:23:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-02 08:23:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-12-02 08:23:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 86 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:23:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2023-12-02 08:23:31,248 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 6 [2023-12-02 08:23:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:23:31,248 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2023-12-02 08:23:31,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 08:23:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2023-12-02 08:23:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 08:23:31,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:23:31,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:23:31,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 08:23:31,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:23:31,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:23:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash 644676676, now seen corresponding path program 1 times [2023-12-02 08:23:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:23:31,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30447638] [2023-12-02 08:23:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:31,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:23:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:31,501 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 08:23:31,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:23:31,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30447638] [2023-12-02 08:23:31,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30447638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:23:31,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:23:31,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:23:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086803318] [2023-12-02 08:23:31,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:23:31,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:23:31,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:23:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:23:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:23:31,504 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 08:23:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:23:31,704 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2023-12-02 08:23:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:23:31,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2023-12-02 08:23:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:23:31,706 INFO L225 Difference]: With dead ends: 88 [2023-12-02 08:23:31,706 INFO L226 Difference]: Without dead ends: 88 [2023-12-02 08:23:31,706 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 08:23:31,708 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:23:31,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 263 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:23:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-02 08:23:31,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-02 08:23:31,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 46 states have (on average 2.0217391304347827) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:23:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2023-12-02 08:23:31,717 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 11 [2023-12-02 08:23:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:23:31,717 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2023-12-02 08:23:31,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 08:23:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2023-12-02 08:23:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 08:23:31,718 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:23:31,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:23:31,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 08:23:31,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:23:31,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:23:31,719 INFO L85 PathProgramCache]: Analyzing trace with hash 644676675, now seen corresponding path program 1 times [2023-12-02 08:23:31,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:23:31,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010027116] [2023-12-02 08:23:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:31,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:23:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:31,807 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 08:23:31,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:23:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010027116] [2023-12-02 08:23:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010027116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:23:31,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:23:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:23:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646279284] [2023-12-02 08:23:31,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:23:31,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 08:23:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:23:31,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 08:23:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 08:23:31,810 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 08:23:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:23:31,968 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-12-02 08:23:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:23:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2023-12-02 08:23:31,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:23:31,969 INFO L225 Difference]: With dead ends: 86 [2023-12-02 08:23:31,969 INFO L226 Difference]: Without dead ends: 86 [2023-12-02 08:23:31,970 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 08:23:31,971 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 9 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:23:31,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 251 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:23:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-02 08:23:31,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-02 08:23:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 46 states have (on average 1.9782608695652173) internal successors, (91), 82 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:23:31,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-12-02 08:23:31,979 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 11 [2023-12-02 08:23:31,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:23:31,979 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-12-02 08:23:31,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 08:23:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-12-02 08:23:31,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 08:23:31,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:23:31,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:23:31,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 08:23:31,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:23:31,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:23:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1530935535, now seen corresponding path program 1 times [2023-12-02 08:23:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:23:31,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803534282] [2023-12-02 08:23:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:23:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:32,040 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 08:23:32,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:23:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803534282] [2023-12-02 08:23:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803534282] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:23:32,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:23:32,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:23:32,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961091058] [2023-12-02 08:23:32,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:23:32,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:23:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:23:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:23:32,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:23:32,043 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 08:23:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:23:32,084 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-12-02 08:23:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:23:32,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2023-12-02 08:23:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:23:32,086 INFO L225 Difference]: With dead ends: 92 [2023-12-02 08:23:32,086 INFO L226 Difference]: Without dead ends: 92 [2023-12-02 08:23:32,087 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 08:23:32,088 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:23:32,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 157 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:23:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-02 08:23:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2023-12-02 08:23:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 50 states have (on average 1.9) internal successors, (95), 86 states have internal predecessors, (95), 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 08:23:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2023-12-02 08:23:32,095 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 14 [2023-12-02 08:23:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:23:32,096 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2023-12-02 08:23:32,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 08:23:32,096 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2023-12-02 08:23:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 08:23:32,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:23:32,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:23:32,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 08:23:32,098 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:23:32,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:23:32,098 INFO L85 PathProgramCache]: Analyzing trace with hash -196982527, now seen corresponding path program 1 times [2023-12-02 08:23:32,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:23:32,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391672373] [2023-12-02 08:23:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:32,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:23:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 08:23:32,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:23:32,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391672373] [2023-12-02 08:23:32,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391672373] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:23:32,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81237681] [2023-12-02 08:23:32,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:32,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:23:32,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:23:32,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:23:32,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 08:23:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:32,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 08:23:32,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:23:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:23:32,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:23:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 08:23:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81237681] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:23:32,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1241920057] [2023-12-02 08:23:32,509 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 08:23:32,509 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:23:32,513 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:23:32,519 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:23:32,519 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:23:34,677 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-12-02 08:23:34,783 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:23:44,663 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1375#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_append_#in~data#1| 5) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_16| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_16| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |v_#memory_int_52| (store |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_52| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8)))) (= |v_#memory_int_51| (store |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_52| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 5))))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_72| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_96| (Array Int Int))) (and (= 0 (select |v_#valid_96| |ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (store |v_#valid_96| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#length_81| (Array Int Int))) (= (store |v_#length_81| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|)) (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_int_51| (Array Int (Array Int Int))) (|v_#memory_int_52| (Array Int (Array Int Int))) (|v_#memory_int_50| (Array Int (Array Int Int)))) (and (= |v_#memory_int_52| (store |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_52| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8)))) (= |v_#memory_int_51| (store |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_50| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_51| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_52| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_52| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 5))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_72| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_96| (Array Int Int))) (and (= 0 (select |v_#valid_96| |ULTIMATE.start_dll_append_~new_last~0#1.base|)) (= (store |v_#valid_96| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|))) (exists ((|v_#length_81| (Array Int Int))) (= (store |v_#length_81| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (= 5 |ULTIMATE.start_dll_append_~data#1|))' at error location [2023-12-02 08:23:44,664 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:23:44,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:23:44,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2023-12-02 08:23:44,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488036966] [2023-12-02 08:23:44,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:23:44,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:23:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:23:44,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:23:44,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=314, Unknown=4, NotChecked=0, Total=380 [2023-12-02 08:23:44,666 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 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 08:23:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:23:44,694 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2023-12-02 08:23:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:23:44,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 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 24 [2023-12-02 08:23:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:23:44,695 INFO L225 Difference]: With dead ends: 93 [2023-12-02 08:23:44,696 INFO L226 Difference]: Without dead ends: 93 [2023-12-02 08:23:44,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=62, Invalid=314, Unknown=4, NotChecked=0, Total=380 [2023-12-02 08:23:44,697 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:23:44,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 161 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:23:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-02 08:23:44,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-02 08:23:44,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 88 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 08:23:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2023-12-02 08:23:44,704 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 24 [2023-12-02 08:23:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:23:44,704 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2023-12-02 08:23:44,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 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 08:23:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2023-12-02 08:23:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 08:23:44,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:23:44,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-02 08:23:44,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 08:23:44,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:23:44,909 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:23:44,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:23:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1713381069, now seen corresponding path program 1 times [2023-12-02 08:23:44,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:23:44,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123822379] [2023-12-02 08:23:44,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:44,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:23:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:23:45,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:23:45,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123822379] [2023-12-02 08:23:45,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123822379] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:23:45,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851695633] [2023-12-02 08:23:45,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:45,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:23:45,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:23:45,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:23:45,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 08:23:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:45,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 08:23:45,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:23:45,396 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 08:23:45,458 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 08:23:45,458 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 08:23:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:23:45,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:23:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:23:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851695633] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:23:45,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1648866683] [2023-12-02 08:23:45,732 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 08:23:45,732 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:23:45,732 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:23:45,733 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:23:45,733 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:23:46,813 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 122 for LOIs [2023-12-02 08:23:47,080 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:23:52,565 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1752#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_114| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_113| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_114| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_114| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 |ULTIMATE.start_dll_create_~head~0#1.base|))) (= (store |v_#memory_$Pointer$.base_113| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_113| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_114| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.base_114|))) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (not (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 2) (exists ((|v_#memory_$Pointer$.offset_113| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_114| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_114| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_114| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_113| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_114| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.offset_114|))) (exists ((|v_#memory_int_91| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_91| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_91| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 1) 4 (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_create_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_create_~data#1| 1))' at error location [2023-12-02 08:23:52,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:23:52,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:23:52,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 18 [2023-12-02 08:23:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593057245] [2023-12-02 08:23:52,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:23:52,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 08:23:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:23:52,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 08:23:52,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2023-12-02 08:23:52,569 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 19 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 08:23:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:23:52,935 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-12-02 08:23:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:23:52,936 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2023-12-02 08:23:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:23:52,937 INFO L225 Difference]: With dead ends: 92 [2023-12-02 08:23:52,937 INFO L226 Difference]: Without dead ends: 92 [2023-12-02 08:23:52,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 08:23:52,939 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 19 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:23:52,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 500 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 08:23:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-02 08:23:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-02 08:23:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 87 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 08:23:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2023-12-02 08:23:52,946 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 27 [2023-12-02 08:23:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:23:52,946 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2023-12-02 08:23:52,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-02 08:23:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2023-12-02 08:23:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 08:23:52,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:23:52,947 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-02 08:23:52,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 08:23:53,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:23:53,148 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:23:53,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:23:53,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1713381070, now seen corresponding path program 1 times [2023-12-02 08:23:53,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:23:53,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872689229] [2023-12-02 08:23:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:53,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:23:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:23:53,622 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:23:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872689229] [2023-12-02 08:23:53,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872689229] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:23:53,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139063435] [2023-12-02 08:23:53,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:23:53,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:23:53,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:23:53,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:23:53,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 08:23:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:23:53,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 08:23:53,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:23:53,741 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 08:23:53,995 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 08:23:53,996 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 08:23:54,001 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 08:23:54,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:23:54,055 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:23:54,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139063435] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:23:54,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [73241439] [2023-12-02 08:23:54,185 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 08:23:54,186 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:23:54,186 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:23:54,186 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:23:54,186 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:23:55,265 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 122 for LOIs [2023-12-02 08:23:55,516 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:24:00,977 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2075#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_134| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_133| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_134| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_134| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 |ULTIMATE.start_dll_create_~head~0#1.base|))) (= |v_#memory_$Pointer$.base_134| (store |v_#memory_$Pointer$.base_133| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_133| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_134| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))))) (<= (select |#length| |ULTIMATE.start_dll_create_~head~0#1.base|) 11) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= |ULTIMATE.start_dll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_create_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_~len#1| 1) (exists ((|v_#memory_int_111| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_111| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_111| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 1) 4 (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#memory_$Pointer$.offset_133| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_134| (store |v_#memory_$Pointer$.offset_133| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_133| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_134| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_134| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_134| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 0))))) (= |ULTIMATE.start_dll_create_~data#1| 1))' at error location [2023-12-02 08:24:00,977 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:24:00,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:24:00,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2023-12-02 08:24:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077387330] [2023-12-02 08:24:00,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:24:00,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 08:24:00,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:24:00,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 08:24:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2023-12-02 08:24:00,980 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 21 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 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 08:24:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:01,555 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-12-02 08:24:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 08:24:01,556 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 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 27 [2023-12-02 08:24:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:01,557 INFO L225 Difference]: With dead ends: 92 [2023-12-02 08:24:01,557 INFO L226 Difference]: Without dead ends: 92 [2023-12-02 08:24:01,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=195, Invalid=1527, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 08:24:01,558 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 11 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:01,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 487 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 08:24:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-02 08:24:01,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2023-12-02 08:24:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 86 states have internal predecessors, (95), 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 08:24:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2023-12-02 08:24:01,562 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 27 [2023-12-02 08:24:01,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:01,562 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2023-12-02 08:24:01,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 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 08:24:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2023-12-02 08:24:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 08:24:01,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:01,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-02 08:24:01,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-02 08:24:01,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:01,764 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:24:01,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1907022403, now seen corresponding path program 2 times [2023-12-02 08:24:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:24:01,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160926753] [2023-12-02 08:24:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:24:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:01,890 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-02 08:24:01,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:24:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160926753] [2023-12-02 08:24:01,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160926753] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305102780] [2023-12-02 08:24:01,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 08:24:01,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:01,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:24:01,893 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:24:01,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 08:24:02,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 08:24:02,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:24:02,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 08:24:02,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:24:02,196 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 08:24:02,225 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|))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-12-02 08:24:02,249 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 08:24:02,260 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 08:24:02,261 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 08:24:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 7 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:24:02,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:24:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 08:24:02,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305102780] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:24:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019258440] [2023-12-02 08:24:02,393 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-12-02 08:24:02,393 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:24:02,393 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:24:02,393 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:24:02,393 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:24:03,676 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-12-02 08:24:03,759 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:24:13,289 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2510#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_append_#in~data#1| 5) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (or (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_36| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_int_143| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_143| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_143| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_142| (store |v_#memory_int_141| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_141| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4)))) (= |v_#memory_int_143| (store |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_143| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8)))))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_36| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_36| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_145| (Array Int Int))) (and (= (select |v_#valid_145| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_145| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1)))) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_163| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_163| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_163| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#length_120| (Array Int Int))) (= (store |v_#length_120| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_163| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_163| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_163| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|)) (and (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_60| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_60| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_int_143| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_143| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_143| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 5))) (= |v_#memory_int_142| (store |v_#memory_int_141| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_141| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4)))) (= |v_#memory_int_143| (store |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_142| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_143| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8)))))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_37| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_37| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_145| (Array Int Int))) (and (= (select |v_#valid_145| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0) (= |#valid| (store |v_#valid_145| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1)))) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_163| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_163| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_163| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#length_120| (Array Int Int))) (= (store |v_#length_120| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (exists ((|v_#memory_$Pointer$.base_163| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_163| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_163| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (= 5 |ULTIMATE.start_dll_append_~data#1|))' at error location [2023-12-02 08:24:13,290 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:24:13,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 08:24:13,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2023-12-02 08:24:13,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489281209] [2023-12-02 08:24:13,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 08:24:13,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 08:24:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:24:13,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 08:24:13,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=615, Unknown=5, NotChecked=50, Total=756 [2023-12-02 08:24:13,292 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 08:24:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:13,653 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-12-02 08:24:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 08:24:13,653 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2023-12-02 08:24:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:13,654 INFO L225 Difference]: With dead ends: 91 [2023-12-02 08:24:13,654 INFO L226 Difference]: Without dead ends: 91 [2023-12-02 08:24:13,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=142, Invalid=1045, Unknown=7, NotChecked=66, Total=1260 [2023-12-02 08:24:13,656 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 249 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:13,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 309 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 355 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2023-12-02 08:24:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-12-02 08:24:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-12-02 08:24:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 86 states have internal predecessors, (94), 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 08:24:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2023-12-02 08:24:13,661 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 37 [2023-12-02 08:24:13,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:13,661 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2023-12-02 08:24:13,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 08:24:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2023-12-02 08:24:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 08:24:13,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:13,663 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:24:13,669 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 08:24:13,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:13,868 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:24:13,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:13,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1880566751, now seen corresponding path program 1 times [2023-12-02 08:24:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:24:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190534186] [2023-12-02 08:24:13,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:13,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:24:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 08:24:14,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:24:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190534186] [2023-12-02 08:24:14,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190534186] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547619948] [2023-12-02 08:24:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:14,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:14,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:24:14,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:24:14,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 08:24:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:14,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 08:24:14,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:24:14,635 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 08:24:14,647 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 08:24:14,681 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 08:24:14,682 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 08:24:14,784 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 9 treesize of output 7 [2023-12-02 08:24:14,792 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 08:24:14,817 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-12-02 08:24:14,817 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 08:24:14,926 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 08:24:14,933 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2023-12-02 08:24:14,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:24:14,957 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 08:24:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 15 not checked. [2023-12-02 08:24:14,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:24:15,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547619948] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:15,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [961573172] [2023-12-02 08:24:15,037 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-12-02 08:24:15,037 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:24:15,038 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:24:15,038 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:24:15,038 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:24:17,351 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-12-02 08:24:17,422 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:24:26,939 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2868#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_append_#in~data#1| 5) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (or (and (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_52| (Array Int (Array Int Int)))) (= 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_52| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#valid_158| (Array Int Int))) (and (= (store |v_#valid_158| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_158| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_52| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_52| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_181| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_181| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_127| (Array Int Int))) (= (store |v_#length_127| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_181| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_181| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_181| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_160| (Array Int (Array Int Int))) (|v_#memory_int_159| (Array Int (Array Int Int))) (|v_#memory_int_161| (Array Int (Array Int Int)))) (and (= |v_#memory_int_160| (store |v_#memory_int_159| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_159| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_160| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_161| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_161| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_160| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_160| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_161| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_161|))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|)) (and (exists ((|v_#valid_158| (Array Int Int))) (and (= (store |v_#valid_158| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_158| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_181| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_181| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_51| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_51| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_127| (Array Int Int))) (= (store |v_#length_127| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_51| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_51| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_$Pointer$.offset_181| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_181| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_181| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#memory_int_160| (Array Int (Array Int Int))) (|v_#memory_int_159| (Array Int (Array Int Int))) (|v_#memory_int_161| (Array Int (Array Int Int)))) (and (= |v_#memory_int_160| (store |v_#memory_int_159| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_159| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_160| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4)))) (= |#memory_int| (store |v_#memory_int_161| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_161| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_160| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_160| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_161| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_161|))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|))) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (= 5 |ULTIMATE.start_dll_append_~data#1|))' at error location [2023-12-02 08:24:26,940 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:24:26,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:24:26,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2023-12-02 08:24:26,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957234335] [2023-12-02 08:24:26,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:24:26,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 08:24:26,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:24:26,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 08:24:26,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1122, Unknown=5, NotChecked=138, Total=1406 [2023-12-02 08:24:26,942 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 21 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:24:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:27,427 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2023-12-02 08:24:27,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:24:27,427 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2023-12-02 08:24:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:27,428 INFO L225 Difference]: With dead ends: 96 [2023-12-02 08:24:27,428 INFO L226 Difference]: Without dead ends: 96 [2023-12-02 08:24:27,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=177, Invalid=1308, Unknown=5, NotChecked=150, Total=1640 [2023-12-02 08:24:27,429 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 293 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:27,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 338 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 463 Invalid, 0 Unknown, 186 Unchecked, 0.3s Time] [2023-12-02 08:24:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-02 08:24:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2023-12-02 08:24:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 81 states have internal predecessors, (89), 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 08:24:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-12-02 08:24:27,432 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 38 [2023-12-02 08:24:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:27,433 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-12-02 08:24:27,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (4), 1 states have call predecessors, (4), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:24:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-12-02 08:24:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 08:24:27,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:27,434 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:24:27,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 08:24:27,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:27,635 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:24:27,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:27,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1880566750, now seen corresponding path program 1 times [2023-12-02 08:24:27,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:24:27,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160336198] [2023-12-02 08:24:27,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:27,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:24:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 08:24:28,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:24:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160336198] [2023-12-02 08:24:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160336198] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:28,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728258776] [2023-12-02 08:24:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:28,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:28,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:24:28,247 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:24:28,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 08:24:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:28,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 08:24:28,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:24:28,416 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 08:24:28,428 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 08:24:28,435 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 08:24:28,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:24:28,465 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 08:24:28,504 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 08:24:28,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:24:28,535 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 08:24:28,581 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 08:24:28,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:24:28,610 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 08:24:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 08:24:28,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:24:28,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728258776] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:24:28,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:24:28,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-02 08:24:28,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13918040] [2023-12-02 08:24:28,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:24:28,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:24:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:24:28,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:24:28,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=103, Unknown=1, NotChecked=20, Total=156 [2023-12-02 08:24:28,618 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:24:28,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:28,753 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2023-12-02 08:24:28,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:24:28,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-12-02 08:24:28,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:28,754 INFO L225 Difference]: With dead ends: 83 [2023-12-02 08:24:28,754 INFO L226 Difference]: Without dead ends: 83 [2023-12-02 08:24:28,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 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 08:24:28,755 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 20 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:28,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 205 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 106 Unchecked, 0.1s Time] [2023-12-02 08:24:28,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-02 08:24:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-02 08:24:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 78 states have internal predecessors, (86), 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 08:24:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2023-12-02 08:24:28,759 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 38 [2023-12-02 08:24:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:28,759 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2023-12-02 08:24:28,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:24:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2023-12-02 08:24:28,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 08:24:28,760 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:28,760 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:24:28,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 08:24:28,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:28,961 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:24:28,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash -410647205, now seen corresponding path program 1 times [2023-12-02 08:24:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:24:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969855103] [2023-12-02 08:24:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:24:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:24:29,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:24:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969855103] [2023-12-02 08:24:29,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969855103] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845347137] [2023-12-02 08:24:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:29,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:24:29,573 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:24:29,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 08:24:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:29,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-02 08:24:29,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:24:29,934 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 08:24:30,056 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-12-02 08:24:30,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:24:30,078 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 08:24:30,096 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-12-02 08:24:30,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2023-12-02 08:24:30,137 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 08:24:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 08:24:30,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:24:30,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845347137] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:24:30,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:24:30,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2023-12-02 08:24:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366638886] [2023-12-02 08:24:30,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:24:30,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 08:24:30,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:24:30,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 08:24:30,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2023-12-02 08:24:30,143 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:24:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:30,539 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2023-12-02 08:24:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 08:24:30,539 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2023-12-02 08:24:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:30,540 INFO L225 Difference]: With dead ends: 83 [2023-12-02 08:24:30,540 INFO L226 Difference]: Without dead ends: 83 [2023-12-02 08:24:30,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=558, Unknown=1, NotChecked=48, Total=702 [2023-12-02 08:24:30,541 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 95 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:30,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 270 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 392 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2023-12-02 08:24:30,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-02 08:24:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2023-12-02 08:24:30,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 77 states have internal predecessors, (86), 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 08:24:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2023-12-02 08:24:30,544 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 41 [2023-12-02 08:24:30,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:30,545 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2023-12-02 08:24:30,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:24:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2023-12-02 08:24:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 08:24:30,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:30,546 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:24:30,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 08:24:30,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 08:24:30,748 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:24:30,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:30,749 INFO L85 PathProgramCache]: Analyzing trace with hash -410647204, now seen corresponding path program 1 times [2023-12-02 08:24:30,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:24:30,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687320142] [2023-12-02 08:24:30,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:24:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:24:32,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:24:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687320142] [2023-12-02 08:24:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687320142] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:32,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963081814] [2023-12-02 08:24:32,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:32,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:32,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:24:32,124 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:24:32,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 08:24:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:32,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 08:24:32,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:24:32,318 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 08:24:32,615 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 08:24:32,619 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 08:24:32,687 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 08:24:32,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:24:32,701 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 08:24:32,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:24:32,708 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 08:24:32,719 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-12-02 08:24:32,719 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 08:24:32,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:24:32,725 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 08:24:32,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 17 treesize of output 9 [2023-12-02 08:24:32,820 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-12-02 08:24:32,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:24:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963081814] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:33,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [984187235] [2023-12-02 08:24:33,105 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 08:24:33,105 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:24:33,106 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:24:33,106 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:24:33,106 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:24:35,035 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-12-02 08:24:35,100 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:24:46,244 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3849#(and (or (and (exists ((|v_#memory_$Pointer$.offset_214| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_214| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_214| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_72| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_72| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#valid_168| (Array Int Int))) (and (= (store |v_#valid_168| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_168| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_217| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_217| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_217| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#length_142| (Array Int Int))) (= |#length| (store |v_#length_142| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_113| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_113| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_int_187| (Array Int (Array Int Int))) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_187| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_187| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_188| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_188|) (= |#memory_int| (store |v_#memory_int_189| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_189| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_188| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_188| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_189| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_189|))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|)) (and (exists ((|v_#memory_$Pointer$.offset_214| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_214| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_214| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))))) (exists ((|v_#valid_168| (Array Int Int))) (and (= (store |v_#valid_168| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#valid|) (= (select |v_#valid_168| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (exists ((|v_#memory_$Pointer$.base_217| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_217| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_217| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 0) 8 0) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) |#memory_$Pointer$.base|)) (exists ((|v_#length_142| (Array Int Int))) (= |#length| (store |v_#length_142| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |ULTIMATE.start_dll_append_~new_last~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_append_~new_last~0#1.base| 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#memory_int_187| (Array Int (Array Int Int))) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_187| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_187| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_188| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_188|) (= |#memory_int| (store |v_#memory_int_189| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_189| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 5))) (= (store |v_#memory_int_188| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_188| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_189| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_189|))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_73| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_73| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)))) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) 0) 0))) (<= 1 |#StackHeapBarrier|) (or (< (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_dll_append_~last~0#1.base|) (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 8))) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_append_#in~data#1| 5) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_append_~head#1.base|) 0) |ULTIMATE.start_dll_append_~last~0#1.offset|) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_append_~head#1.base|) 0) |ULTIMATE.start_dll_append_~last~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= (select |#valid| |ULTIMATE.start_dll_append_~head#1.base|) 1) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (= 5 |ULTIMATE.start_dll_append_~data#1|) (<= 4 (select |#length| |ULTIMATE.start_dll_append_~head#1.base|)))' at error location [2023-12-02 08:24:46,244 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:24:46,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:24:46,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-12-02 08:24:46,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894994863] [2023-12-02 08:24:46,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:24:46,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 08:24:46,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:24:46,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 08:24:46,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2080, Unknown=9, NotChecked=92, Total=2352 [2023-12-02 08:24:46,247 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 27 states, 20 states have (on average 2.95) internal successors, (59), 24 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:24:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:47,548 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2023-12-02 08:24:47,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 08:24:47,548 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 20 states have (on average 2.95) internal successors, (59), 24 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-12-02 08:24:47,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:47,549 INFO L225 Difference]: With dead ends: 89 [2023-12-02 08:24:47,549 INFO L226 Difference]: Without dead ends: 89 [2023-12-02 08:24:47,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=251, Invalid=2933, Unknown=12, NotChecked=110, Total=3306 [2023-12-02 08:24:47,550 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 121 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:47,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 636 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 889 Invalid, 0 Unknown, 93 Unchecked, 0.8s Time] [2023-12-02 08:24:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-02 08:24:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2023-12-02 08:24:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 80 states have internal predecessors, (89), 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 08:24:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2023-12-02 08:24:47,553 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 41 [2023-12-02 08:24:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:47,553 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2023-12-02 08:24:47,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 20 states have (on average 2.95) internal successors, (59), 24 states have internal predecessors, (59), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:24:47,554 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2023-12-02 08:24:47,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 08:24:47,554 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:47,554 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:24:47,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 08:24:47,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 08:24:47,755 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:24:47,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash 154533700, now seen corresponding path program 1 times [2023-12-02 08:24:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:24:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498771888] [2023-12-02 08:24:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:24:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-12-02 08:24:47,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:24:47,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498771888] [2023-12-02 08:24:47,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498771888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:24:47,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:24:47,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 08:24:47,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692504213] [2023-12-02 08:24:47,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:24:47,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:24:47,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:24:47,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:24:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:24:47,992 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:24:48,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:48,106 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2023-12-02 08:24:48,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:24:48,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2023-12-02 08:24:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:48,107 INFO L225 Difference]: With dead ends: 83 [2023-12-02 08:24:48,107 INFO L226 Difference]: Without dead ends: 83 [2023-12-02 08:24:48,107 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 08:24:48,108 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 88 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:48,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 166 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 08:24:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-02 08:24:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-12-02 08:24:48,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 78 states have internal predecessors, (87), 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 08:24:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2023-12-02 08:24:48,112 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 42 [2023-12-02 08:24:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:48,112 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2023-12-02 08:24:48,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:24:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2023-12-02 08:24:48,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 08:24:48,114 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:48,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:24:48,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 08:24:48,114 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:24:48,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash 495581210, now seen corresponding path program 1 times [2023-12-02 08:24:48,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:24:48,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730527408] [2023-12-02 08:24:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:24:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-12-02 08:24:48,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:24:48,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730527408] [2023-12-02 08:24:48,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730527408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:24:48,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:24:48,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:24:48,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616719114] [2023-12-02 08:24:48,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:24:48,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:24:48,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:24:48,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:24:48,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:24:48,431 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 9 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:24:48,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:48,650 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2023-12-02 08:24:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 08:24:48,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2023-12-02 08:24:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:48,651 INFO L225 Difference]: With dead ends: 126 [2023-12-02 08:24:48,651 INFO L226 Difference]: Without dead ends: 126 [2023-12-02 08:24:48,652 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 08:24:48,652 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 129 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:48,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 206 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:24:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-02 08:24:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 83. [2023-12-02 08:24:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 78 states have internal predecessors, (89), 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 08:24:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2023-12-02 08:24:48,656 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 43 [2023-12-02 08:24:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:48,657 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2023-12-02 08:24:48,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.166666666666667) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:24:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2023-12-02 08:24:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-02 08:24:48,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:48,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:24:48,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 08:24:48,658 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:24:48,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 495581211, now seen corresponding path program 1 times [2023-12-02 08:24:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:24:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072991572] [2023-12-02 08:24:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:24:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-02 08:24:49,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:24:49,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072991572] [2023-12-02 08:24:49,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072991572] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:24:49,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:24:49,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:24:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130361805] [2023-12-02 08:24:49,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:24:49,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 08:24:49,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:24:49,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 08:24:49,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 08:24:49,115 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 9 states, 6 states have (on average 4.5) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:24:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:49,300 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2023-12-02 08:24:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 08:24:49,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 4.5) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2023-12-02 08:24:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:49,302 INFO L225 Difference]: With dead ends: 136 [2023-12-02 08:24:49,302 INFO L226 Difference]: Without dead ends: 136 [2023-12-02 08:24:49,302 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 08:24:49,303 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 118 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:49,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 259 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 08:24:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-02 08:24:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 89. [2023-12-02 08:24:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 84 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 08:24:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2023-12-02 08:24:49,307 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 43 [2023-12-02 08:24:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:49,308 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2023-12-02 08:24:49,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 4.5) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 08:24:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2023-12-02 08:24:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 08:24:49,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:49,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:24:49,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 08:24:49,310 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:24:49,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1523986897, now seen corresponding path program 1 times [2023-12-02 08:24:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:24:49,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133806473] [2023-12-02 08:24:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:24:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:24:51,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:24:51,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133806473] [2023-12-02 08:24:51,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133806473] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:51,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168643040] [2023-12-02 08:24:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:51,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:51,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:24:51,845 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:24:51,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 08:24:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:52,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 93 conjunts are in the unsatisfiable core [2023-12-02 08:24:52,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:24:52,038 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 08:24:52,164 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 08:24:52,164 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 08:24:52,457 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 08:24:52,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-12-02 08:24:52,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 08:24:52,712 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:24:52,713 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-12-02 08:24:53,065 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|))) (= |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 08:24:53,115 INFO L349 Elim1Store]: treesize reduction 112, result has 31.7 percent of original size [2023-12-02 08:24:53,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 64 [2023-12-02 08:24:53,129 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 08:24:53,130 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 75 treesize of output 56 [2023-12-02 08:24:53,140 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 08:24:53,213 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 08:24:53,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:24:53,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2023-12-02 08:24:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-12-02 08:24:53,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:24:53,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168643040] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:24:53,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [787525142] [2023-12-02 08:24:53,640 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 08:24:53,640 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:24:53,640 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:24:53,641 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:24:53,641 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:24:55,629 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-12-02 08:24:55,689 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:25:06,674 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4905#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_append_~last~0#1.base|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_append_#in~data#1| 5) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= 5 |ULTIMATE.start_dll_append_~data#1|))' at error location [2023-12-02 08:25:06,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:25:06,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:25:06,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2023-12-02 08:25:06,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936864512] [2023-12-02 08:25:06,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:25:06,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-02 08:25:06,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:25:06,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-02 08:25:06,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=4398, Unknown=7, NotChecked=134, Total=4830 [2023-12-02 08:25:06,676 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 40 states have internal predecessors, (76), 6 states have call successors, (6), 2 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 08:25:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:25:08,632 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2023-12-02 08:25:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 08:25:08,632 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 40 states have internal predecessors, (76), 6 states have call successors, (6), 2 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 44 [2023-12-02 08:25:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:25:08,634 INFO L225 Difference]: With dead ends: 108 [2023-12-02 08:25:08,634 INFO L226 Difference]: Without dead ends: 108 [2023-12-02 08:25:08,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=553, Invalid=6926, Unknown=7, NotChecked=170, Total=7656 [2023-12-02 08:25:08,637 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 216 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:25:08,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 668 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1218 Invalid, 0 Unknown, 108 Unchecked, 1.0s Time] [2023-12-02 08:25:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-02 08:25:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-12-02 08:25:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 85 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 08:25:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 105 transitions. [2023-12-02 08:25:08,640 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 105 transitions. Word has length 44 [2023-12-02 08:25:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:25:08,640 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 105 transitions. [2023-12-02 08:25:08,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 40 states have internal predecessors, (76), 6 states have call successors, (6), 2 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 08:25:08,641 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2023-12-02 08:25:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 08:25:08,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:25:08,641 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:25:08,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 08:25:08,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 08:25:08,842 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:25:08,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:25:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1523986896, now seen corresponding path program 1 times [2023-12-02 08:25:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:25:08,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852579892] [2023-12-02 08:25:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:25:08,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:25:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:25:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:25:11,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:25:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852579892] [2023-12-02 08:25:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852579892] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:25:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440401753] [2023-12-02 08:25:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:25:11,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:25:11,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:25:11,244 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:25:11,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 08:25:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:25:11,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 110 conjunts are in the unsatisfiable core [2023-12-02 08:25:11,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:25:11,482 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 08:25:11,831 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 08:25:11,831 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 08:25:11,998 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 08:25:12,008 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 08:25:12,121 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:25:12,121 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 59 treesize of output 52 [2023-12-02 08:25:12,128 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 24 treesize of output 11 [2023-12-02 08:25:12,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:25:12,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2023-12-02 08:25:12,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 08:25:12,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-02 08:25:12,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:25:12,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 08:25:12,445 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 08:25:12,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:12,470 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 08:25:12,470 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 08:25:12,492 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 08:25:12,492 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 08:25:12,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:12,500 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-02 08:25:12,501 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 1 case distinctions, treesize of input 27 treesize of output 25 [2023-12-02 08:25:12,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 17 [2023-12-02 08:25:12,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:25:12,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-12-02 08:25:12,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:25:12,727 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 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 08:25:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 08:25:12,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:25:13,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440401753] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:25:13,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [175446338] [2023-12-02 08:25:13,182 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 08:25:13,182 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:25:13,182 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:25:13,183 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:25:13,183 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:25:14,543 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-12-02 08:25:14,601 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:25:26,158 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5366#(and (<= 1 |#StackHeapBarrier|) (or (< (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_dll_append_~last~0#1.base|) (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 8))) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_append_#in~data#1| 5) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= 5 |ULTIMATE.start_dll_append_~data#1|))' at error location [2023-12-02 08:25:26,158 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:25:26,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:25:26,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 46 [2023-12-02 08:25:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613711389] [2023-12-02 08:25:26,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:25:26,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-12-02 08:25:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:25:26,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-12-02 08:25:26,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=4689, Unknown=11, NotChecked=138, Total=5112 [2023-12-02 08:25:26,162 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 47 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 states have internal predecessors, (72), 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 08:25:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:25:28,523 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2023-12-02 08:25:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 08:25:28,523 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 states have internal predecessors, (72), 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 44 [2023-12-02 08:25:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:25:28,525 INFO L225 Difference]: With dead ends: 95 [2023-12-02 08:25:28,525 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 08:25:28,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2030 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=456, Invalid=7187, Unknown=17, NotChecked=172, Total=7832 [2023-12-02 08:25:28,528 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 186 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:25:28,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1025 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1734 Invalid, 0 Unknown, 95 Unchecked, 1.2s Time] [2023-12-02 08:25:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 08:25:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2023-12-02 08:25:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 87 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 08:25:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2023-12-02 08:25:28,531 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 44 [2023-12-02 08:25:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:25:28,532 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2023-12-02 08:25:28,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 38 states have (on average 1.894736842105263) internal successors, (72), 39 states have internal predecessors, (72), 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 08:25:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2023-12-02 08:25:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 08:25:28,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:25:28,533 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:25:28,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 08:25:28,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:25:28,733 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:25:28,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:25:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1005675739, now seen corresponding path program 2 times [2023-12-02 08:25:28,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:25:28,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814856963] [2023-12-02 08:25:28,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:25:28,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:25:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:25:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:25:32,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:25:32,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814856963] [2023-12-02 08:25:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814856963] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:25:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262871950] [2023-12-02 08:25:32,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 08:25:32,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:25:32,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:25:32,063 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:25:32,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 08:25:32,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 08:25:32,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 08:25:32,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 107 conjunts are in the unsatisfiable core [2023-12-02 08:25:32,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:25:32,648 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 13 treesize of output 9 [2023-12-02 08:25:32,653 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 13 treesize of output 9 [2023-12-02 08:25:32,958 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 08:25:32,958 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 18 treesize of output 17 [2023-12-02 08:25:32,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 08:25:32,973 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 08:25:32,973 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 08:25:32,978 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 08:25:33,109 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 08:25:33,119 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 08:25:33,196 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 23 treesize of output 22 [2023-12-02 08:25:33,205 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 23 treesize of output 22 [2023-12-02 08:25:33,325 INFO L349 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2023-12-02 08:25:33,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 89 [2023-12-02 08:25:33,343 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2023-12-02 08:25:33,344 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 79 [2023-12-02 08:25:33,738 INFO L349 Elim1Store]: treesize reduction 59, result has 32.2 percent of original size [2023-12-02 08:25:33,739 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 8 new quantified variables, introduced 6 case distinctions, treesize of input 207 treesize of output 126 [2023-12-02 08:25:33,767 INFO L349 Elim1Store]: treesize reduction 33, result has 26.7 percent of original size [2023-12-02 08:25:33,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 59 [2023-12-02 08:25:33,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 08:25:33,854 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$.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 08:25:33,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:33,892 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2023-12-02 08:25:33,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 215 treesize of output 168 [2023-12-02 08:25:33,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:33,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:33,913 INFO L349 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2023-12-02 08:25:33,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 158 [2023-12-02 08:25:33,936 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2023-12-02 08:25:33,937 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 34 treesize of output 36 [2023-12-02 08:25:34,543 INFO L349 Elim1Store]: treesize reduction 125, result has 11.3 percent of original size [2023-12-02 08:25:34,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 222 treesize of output 129 [2023-12-02 08:25:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-12-02 08:25:34,803 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:25:35,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262871950] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:25:35,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [431268626] [2023-12-02 08:25:35,442 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2023-12-02 08:25:35,442 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:25:35,442 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:25:35,442 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:25:35,442 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:25:37,424 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-12-02 08:25:37,488 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:25:49,423 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5835#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_append_~last~0#1.base|) 1)) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_append_#in~data#1| 5) (= |ULTIMATE.start_dll_append_~new_last~0#1.offset| 0) (= |ULTIMATE.start_dll_append_~head#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 2 |ULTIMATE.start_dll_append_~head#1.base|) (= |ULTIMATE.start_dll_append_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (= 5 |ULTIMATE.start_dll_append_~data#1|))' at error location [2023-12-02 08:25:49,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:25:49,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:25:49,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 48 [2023-12-02 08:25:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768550414] [2023-12-02 08:25:49,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:25:49,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-02 08:25:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:25:49,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-02 08:25:49,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4865, Unknown=11, NotChecked=140, Total=5256 [2023-12-02 08:25:49,427 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 48 states, 41 states have (on average 1.853658536585366) internal successors, (76), 44 states have internal predecessors, (76), 6 states have call successors, (6), 2 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 08:25:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:25:53,101 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2023-12-02 08:25:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-02 08:25:53,101 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 41 states have (on average 1.853658536585366) internal successors, (76), 44 states have internal predecessors, (76), 6 states have call successors, (6), 2 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 47 [2023-12-02 08:25:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:25:53,102 INFO L225 Difference]: With dead ends: 114 [2023-12-02 08:25:53,103 INFO L226 Difference]: Without dead ends: 114 [2023-12-02 08:25:53,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1731 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=407, Invalid=7775, Unknown=12, NotChecked=178, Total=8372 [2023-12-02 08:25:53,106 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 33 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 08:25:53,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1110 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1434 Invalid, 0 Unknown, 110 Unchecked, 1.6s Time] [2023-12-02 08:25:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-02 08:25:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2023-12-02 08:25:53,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 103 states have internal predecessors, (120), 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 08:25:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2023-12-02 08:25:53,111 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 47 [2023-12-02 08:25:53,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:25:53,111 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2023-12-02 08:25:53,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 41 states have (on average 1.853658536585366) internal successors, (76), 44 states have internal predecessors, (76), 6 states have call successors, (6), 2 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 08:25:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2023-12-02 08:25:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 08:25:53,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:25:53,112 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:25:53,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 08:25:53,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:25:53,313 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:25:53,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:25:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash 826229973, now seen corresponding path program 1 times [2023-12-02 08:25:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:25:53,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024617107] [2023-12-02 08:25:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:25:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:25:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:25:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:25:53,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:25:53,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024617107] [2023-12-02 08:25:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024617107] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:25:53,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:25:53,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-02 08:25:53,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907330009] [2023-12-02 08:25:53,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:25:53,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 08:25:53,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:25:53,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 08:25:53,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2023-12-02 08:25:53,894 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 20 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:25:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:25:54,651 INFO L93 Difference]: Finished difference Result 158 states and 183 transitions. [2023-12-02 08:25:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 08:25:54,651 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2023-12-02 08:25:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:25:54,652 INFO L225 Difference]: With dead ends: 158 [2023-12-02 08:25:54,653 INFO L226 Difference]: Without dead ends: 158 [2023-12-02 08:25:54,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2023-12-02 08:25:54,654 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 177 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 08:25:54,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 728 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 08:25:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-12-02 08:25:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 115. [2023-12-02 08:25:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 108 states have internal predecessors, (126), 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 08:25:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2023-12-02 08:25:54,659 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 47 [2023-12-02 08:25:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:25:54,659 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2023-12-02 08:25:54,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:25:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2023-12-02 08:25:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 08:25:54,659 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:25:54,659 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:25:54,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-02 08:25:54,660 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:25:54,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:25:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash 826229974, now seen corresponding path program 1 times [2023-12-02 08:25:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:25:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114802947] [2023-12-02 08:25:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:25:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:25:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:25:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:25:56,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:25:56,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114802947] [2023-12-02 08:25:56,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114802947] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:25:56,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88458403] [2023-12-02 08:25:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:25:56,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:25:56,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:25:56,289 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:25:56,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 08:25:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:25:56,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 08:25:56,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:25:56,858 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 08:25:56,861 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 08:25:57,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:57,072 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 16 treesize of output 11 [2023-12-02 08:25:57,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:57,081 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 08:25:57,394 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:25:57,395 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 57 treesize of output 52 [2023-12-02 08:25:57,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:57,399 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 39 treesize of output 24 [2023-12-02 08:25:57,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:57,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-12-02 08:25:57,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:57,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-12-02 08:25:57,549 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 32 treesize of output 20 [2023-12-02 08:25:57,551 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 08:25:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:25:57,596 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:25:57,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88458403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:25:57,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 08:25:57,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [20] total 39 [2023-12-02 08:25:57,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514830029] [2023-12-02 08:25:57,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:25:57,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 08:25:57,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:25:57,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 08:25:57,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1437, Unknown=0, NotChecked=0, Total=1560 [2023-12-02 08:25:57,598 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 21 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 18 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:25:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:25:58,483 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2023-12-02 08:25:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 08:25:58,484 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 18 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2023-12-02 08:25:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:25:58,485 INFO L225 Difference]: With dead ends: 169 [2023-12-02 08:25:58,485 INFO L226 Difference]: Without dead ends: 169 [2023-12-02 08:25:58,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=205, Invalid=2345, Unknown=0, NotChecked=0, Total=2550 [2023-12-02 08:25:58,487 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 206 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 08:25:58,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 827 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 08:25:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-12-02 08:25:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 112. [2023-12-02 08:25:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 105 states have internal predecessors, (122), 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 08:25:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2023-12-02 08:25:58,491 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 47 [2023-12-02 08:25:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:25:58,492 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2023-12-02 08:25:58,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 18 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 08:25:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2023-12-02 08:25:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 08:25:58,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:25:58,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:25:58,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 08:25:58,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 08:25:58,693 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:25:58,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:25:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1406523942, now seen corresponding path program 1 times [2023-12-02 08:25:58,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:25:58,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335822204] [2023-12-02 08:25:58,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:25:58,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:25:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:25:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:25:59,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:25:59,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335822204] [2023-12-02 08:25:59,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335822204] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:25:59,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261102026] [2023-12-02 08:25:59,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:25:59,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:25:59,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:25:59,029 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:25:59,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 08:25:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:25:59,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 08:25:59,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:25:59,242 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 08:25:59,308 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 08:25:59,308 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 08:25:59,430 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 08:25:59,430 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 1 case distinctions, treesize of input 18 treesize of output 17 [2023-12-02 08:25:59,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:25:59,734 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 26 treesize of output 19 [2023-12-02 08:25:59,747 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-12-02 08:25:59,747 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 3 case distinctions, treesize of input 20 treesize of output 22 [2023-12-02 08:25:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 08:25:59,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:25:59,986 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| Int) (v_ArrVal_2880 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38|) 0)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_38| v_ArrVal_2880) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 0)))) is different from false [2023-12-02 08:25:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261102026] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:25:59,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1864234725] [2023-12-02 08:25:59,989 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 08:25:59,989 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:25:59,989 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:25:59,989 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:25:59,989 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:26:02,106 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-12-02 08:26:02,164 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:26:40,080 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7133#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_22| Int) (|v_#memory_$Pointer$.offset_369| (Array Int (Array Int Int))) (|v_#memory_int_313| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_379| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_#in~head#1.base_10| Int)) (and (= |#memory_int| (store |v_#memory_int_313| |v_ULTIMATE.start_dll_append_~head#1.base_22| (store (select |v_#memory_int_313| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_369| |v_ULTIMATE.start_dll_append_~head#1.base_22| (store (select |v_#memory_$Pointer$.offset_369| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0 0))) (= (select (select |v_#memory_$Pointer$.base_379| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 0) (or (and (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_350| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_369| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 0))) |v_#memory_$Pointer$.offset_369|)) (exists ((|v_#memory_$Pointer$.base_360| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_379| (store |v_#memory_$Pointer$.base_360| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (store (store (select |v_#memory_$Pointer$.base_360| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_379| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 0))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_132| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_132| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#valid_214| (Array Int Int))) (and (= (store |v_#valid_214| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 1) |#valid|) (= (select |v_#valid_214| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0))) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_173| (Array Int Int))) (= (store |v_#length_173| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 12) |#length|)) (exists ((|v_#memory_$Pointer$.offset_BEFORE_CALL_221| (Array Int (Array Int Int)))) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_221| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_#memory_int_294| (Array Int (Array Int Int))) (|v_#memory_int_295| (Array Int (Array Int Int))) (|v_#memory_int_296| (Array Int (Array Int Int)))) (and (= |v_#memory_int_313| (store |v_#memory_int_296| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_int_296| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 0 5))) (= (store |v_#memory_int_295| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_int_295| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 8 (select (select |v_#memory_int_296| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 8))) |v_#memory_int_296|) (= (store |v_#memory_int_294| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_int_294| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 4 (select (select |v_#memory_int_295| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 4))) |v_#memory_int_295|))) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_10| |v_ULTIMATE.start_dll_append_~head#1.base_22|)) (and (<= (+ 1 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_350| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (store (store (select |v_#memory_$Pointer$.offset_350| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.offset_369| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 0))) |v_#memory_$Pointer$.offset_369|)) (exists ((|v_#memory_$Pointer$.base_360| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.base_379| (store |v_#memory_$Pointer$.base_360| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (store (store (select |v_#memory_$Pointer$.base_360| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 4 0) 8 0) 0 (select (select |v_#memory_$Pointer$.base_379| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 0))))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_131| (Array Int (Array Int Int)))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_131| |ULTIMATE.start_main_~#s~0#1.base|) 0) 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_131| (Array Int (Array Int Int)))) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_131| |ULTIMATE.start_main_~#s~0#1.base|) 0))) (exists ((|v_#valid_214| (Array Int Int))) (and (= (store |v_#valid_214| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 1) |#valid|) (= (select |v_#valid_214| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0))) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_10| |ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#length_173| (Array Int Int))) (= (store |v_#length_173| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 12) |#length|)) (exists ((|v_#memory_int_294| (Array Int (Array Int Int))) (|v_#memory_int_295| (Array Int (Array Int Int))) (|v_#memory_int_296| (Array Int (Array Int Int)))) (and (= |v_#memory_int_313| (store |v_#memory_int_296| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_int_296| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 0 5))) (= (store |v_#memory_int_295| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_int_295| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 8 (select (select |v_#memory_int_296| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 8))) |v_#memory_int_296|) (= (store |v_#memory_int_294| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) (store (select |v_#memory_int_294| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 4 (select (select |v_#memory_int_295| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)) 4))) |v_#memory_int_295|))) (= |v_ULTIMATE.start_dll_append_#in~head#1.base_10| |v_ULTIMATE.start_dll_append_~head#1.base_22|))) (= (select (select |v_#memory_$Pointer$.offset_369| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_379| |v_ULTIMATE.start_dll_append_~head#1.base_22| (store (select |v_#memory_$Pointer$.base_379| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~head#1.base_22|) 0)))))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 08:26:40,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:26:40,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:26:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 37 [2023-12-02 08:26:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710620425] [2023-12-02 08:26:40,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:26:40,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 08:26:40,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:26:40,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 08:26:40,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=3384, Unknown=20, NotChecked=118, Total=3782 [2023-12-02 08:26:40,082 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand has 37 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 08:26:41,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:26:41,320 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2023-12-02 08:26:41,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 08:26:41,320 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2023-12-02 08:26:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:26:41,321 INFO L225 Difference]: With dead ends: 121 [2023-12-02 08:26:41,321 INFO L226 Difference]: Without dead ends: 121 [2023-12-02 08:26:41,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=453, Invalid=5227, Unknown=24, NotChecked=148, Total=5852 [2023-12-02 08:26:41,322 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 286 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:26:41,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 674 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 08:26:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-02 08:26:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2023-12-02 08:26:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 87 states have (on average 1.367816091954023) internal successors, (119), 104 states have internal predecessors, (119), 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 08:26:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2023-12-02 08:26:41,325 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 48 [2023-12-02 08:26:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:26:41,325 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2023-12-02 08:26:41,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 30 states have (on average 2.466666666666667) internal successors, (74), 30 states have internal predecessors, (74), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-12-02 08:26:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2023-12-02 08:26:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 08:26:41,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:26:41,326 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:26:41,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 08:26:41,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:26:41,527 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:26:41,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:26:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1785323863, now seen corresponding path program 1 times [2023-12-02 08:26:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:26:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415773039] [2023-12-02 08:26:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:26:41,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:26:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:26:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:26:42,894 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:26:42,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415773039] [2023-12-02 08:26:42,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415773039] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:26:42,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627264556] [2023-12-02 08:26:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:26:42,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:26:42,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:26:42,895 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:26:42,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 08:26:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:26:43,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-02 08:26:43,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:26:43,438 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 08:26:43,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:26:43,624 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 08:26:44,061 INFO L349 Elim1Store]: treesize reduction 37, result has 33.9 percent of original size [2023-12-02 08:26:44,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 46 treesize of output 31 [2023-12-02 08:26:44,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:26:44,075 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 26 treesize of output 19 [2023-12-02 08:26:44,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 08:26:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:26:44,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:26:44,182 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3094 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3094) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-12-02 08:26:46,521 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-12-02 08:26:46,521 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 29 treesize of output 28 [2023-12-02 08:26:46,874 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3092 Int) (v_ArrVal_3099 (Array Int Int)) (|ULTIMATE.start_dll_append_~last~0#1.offset| Int) (|v_ULTIMATE.start_dll_append_~last~0#1.base_57| Int) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| Int) (v_ArrVal_3094 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_3099))) (let ((.cse0 (select .cse2 |v_ULTIMATE.start_dll_append_~last~0#1.base_57|)) (.cse1 (+ |ULTIMATE.start_dll_append_~last~0#1.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (= (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_57| (store .cse0 .cse1 v_ArrVal_3092)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| v_ArrVal_3094) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select .cse2 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_43| 1)))))) is different from false [2023-12-02 08:26:46,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627264556] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:26:46,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1974870587] [2023-12-02 08:26:46,878 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 08:26:46,878 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:26:46,878 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:26:46,878 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:26:46,878 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:26:48,921 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-12-02 08:26:48,978 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:27:02,054 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7661#(and (<= 1 |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (not (= (select |#valid| |ULTIMATE.start_main_~ptr~0#1.base|) 1)) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_#memory_$Pointer$.base_417| (Array Int (Array Int Int))) (|v_#memory_int_345| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| Int) (|v_#memory_int_344| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_400| (Array Int (Array Int Int)))) (and (<= 12 (select |#length| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|)) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) 4)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_400| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) (store (select |v_#memory_$Pointer$.offset_400| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select (store |v_#memory_$Pointer$.offset_400| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) (store (select |v_#memory_$Pointer$.offset_400| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_417| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) (store (select |v_#memory_$Pointer$.base_417| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select (store |v_#memory_$Pointer$.base_417| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) (store (select |v_#memory_$Pointer$.base_417| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)))) (= |#memory_int| (store |v_#memory_int_345| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29| (store (select |v_#memory_int_345| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)))) (= (select |#valid| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 1) (<= (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) 8) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8))) (= (store |v_#memory_int_344| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) (store (select |v_#memory_int_344| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) 4) (select (select |v_#memory_int_345| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_29|) 8) 4)))) |v_#memory_int_345|))) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 08:27:02,054 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:27:02,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:27:02,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 43 [2023-12-02 08:27:02,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351966535] [2023-12-02 08:27:02,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:27:02,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-02 08:27:02,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:27:02,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-02 08:27:02,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=5110, Unknown=31, NotChecked=290, Total=5700 [2023-12-02 08:27:02,056 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 44 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:27:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:27:04,689 INFO L93 Difference]: Finished difference Result 146 states and 168 transitions. [2023-12-02 08:27:04,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-02 08:27:04,689 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2023-12-02 08:27:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:27:04,690 INFO L225 Difference]: With dead ends: 146 [2023-12-02 08:27:04,690 INFO L226 Difference]: Without dead ends: 146 [2023-12-02 08:27:04,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2529 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=644, Invalid=9030, Unknown=36, NotChecked=390, Total=10100 [2023-12-02 08:27:04,691 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 395 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 08:27:04,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 711 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 08:27:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-02 08:27:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2023-12-02 08:27:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 103 states have internal predecessors, (118), 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 08:27:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2023-12-02 08:27:04,696 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 50 [2023-12-02 08:27:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:27:04,696 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2023-12-02 08:27:04,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 37 states have (on average 2.189189189189189) internal successors, (81), 38 states have internal predecessors, (81), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:27:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2023-12-02 08:27:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-02 08:27:04,697 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:27:04,697 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:27:04,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 08:27:04,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 08:27:04,898 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:27:04,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:27:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1785323862, now seen corresponding path program 1 times [2023-12-02 08:27:04,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:27:04,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907416177] [2023-12-02 08:27:04,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:27:04,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:27:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:27:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:27:06,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:27:06,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907416177] [2023-12-02 08:27:06,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907416177] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:27:06,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379016644] [2023-12-02 08:27:06,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:27:06,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:27:06,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:27:06,539 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:27:06,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 08:27:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:27:06,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 79 conjunts are in the unsatisfiable core [2023-12-02 08:27:06,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:27:07,146 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 08:27:07,148 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 08:27:07,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:27:07,234 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 16 treesize of output 11 [2023-12-02 08:27:07,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:27:07,242 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 08:27:07,656 INFO L349 Elim1Store]: treesize reduction 37, result has 33.9 percent of original size [2023-12-02 08:27:07,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 46 treesize of output 31 [2023-12-02 08:27:07,668 INFO L349 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2023-12-02 08:27:07,668 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 27 treesize of output 11 [2023-12-02 08:27:07,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:27:07,683 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 16 treesize of output 11 [2023-12-02 08:27:07,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:27:07,689 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 26 treesize of output 19 [2023-12-02 08:27:07,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 08:27:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 08:27:07,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:27:07,903 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3319 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3319) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_3318 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3319) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3318) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-12-02 08:27:08,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:27:08,419 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 94 treesize of output 98 [2023-12-02 08:27:13,251 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| Int)) (or (forall ((v_prenex_15 Int) (v_ArrVal_3317 Int) (v_prenex_14 Int) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3329 (Array Int Int)) (v_ArrVal_3319 (Array Int Int))) (let ((.cse0 (+ v_prenex_14 4))) (or (< 0 (+ 5 (select (select (store (store |c_#memory_$Pointer$.offset| v_prenex_15 (store (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| v_ArrVal_3329) v_prenex_15) .cse0 v_ArrVal_3317)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| v_ArrVal_3319) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| v_ArrVal_3328) v_prenex_15) .cse0) 0))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| 1)))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| 1)) (forall ((v_prenex_12 Int) (v_prenex_11 Int) (v_prenex_13 (Array Int Int)) (v_prenex_10 Int) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3329 (Array Int Int))) (let ((.cse2 (+ v_prenex_11 4))) (or (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| v_ArrVal_3329))) (< (select (select (store (store |c_#memory_$Pointer$.offset| v_prenex_12 (store (select .cse1 v_prenex_12) .cse2 v_prenex_10)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| v_prenex_13) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (+ (select (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 1))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| v_ArrVal_3328) v_prenex_12) .cse2) 0))))))) (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| Int)) (or (forall ((v_prenex_12 Int) (v_prenex_11 Int) (v_ArrVal_3316 Int) (v_ArrVal_3328 (Array Int Int)) (v_ArrVal_3318 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| v_ArrVal_3328))) (let ((.cse3 (select .cse5 v_prenex_12)) (.cse4 (+ v_prenex_11 4))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| v_prenex_12 (store .cse3 .cse4 v_ArrVal_3316)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| v_ArrVal_3318) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (select (select .cse5 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (not (= (select .cse3 .cse4) 0)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_48| 1))))) is different from false [2023-12-02 08:27:13,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379016644] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:27:13,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [248370886] [2023-12-02 08:27:13,255 INFO L159 IcfgInterpreter]: Started Sifa with 29 locations of interest [2023-12-02 08:27:13,255 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:27:13,256 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:27:13,256 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:27:13,256 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:27:14,577 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-12-02 08:27:14,634 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:27:29,330 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8234#(and (<= 1 |#StackHeapBarrier|) (or (< (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 8))) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_append_~new_last~0#1.base_32| Int) (|v_#memory_int_371| (Array Int (Array Int Int))) (|v_#memory_int_370| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_450| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_433| (Array Int (Array Int Int)))) (and (<= (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 8) (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_433| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) (store (select |v_#memory_$Pointer$.offset_433| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32| (store (select (store |v_#memory_$Pointer$.offset_433| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) (store (select |v_#memory_$Pointer$.offset_433| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4) 0)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)))) (= (store |v_#memory_int_370| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) (store (select |v_#memory_int_370| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4) (select (select |v_#memory_int_371| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4)))) |v_#memory_int_371|) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4)) (= (store (store |v_#memory_$Pointer$.base_450| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) (store (select |v_#memory_$Pointer$.base_450| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32| (store (select (store |v_#memory_$Pointer$.base_450| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) (store (select |v_#memory_$Pointer$.base_450| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8) 4) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|)) |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8))) |#memory_$Pointer$.base|) (= |#memory_int| (store |v_#memory_int_371| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32| (store (select |v_#memory_int_371| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8 (select (select |#memory_int| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 8)))) (= (select |#valid| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|) 1) (<= 12 (select |#length| |v_ULTIMATE.start_dll_append_~new_last~0#1.base_32|)))) (= |ULTIMATE.start_main_~len~0#1| 2) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) 0) |ULTIMATE.start_main_~ptr~0#1.base|) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|))' at error location [2023-12-02 08:27:29,330 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 08:27:29,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 08:27:29,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20] total 40 [2023-12-02 08:27:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727252046] [2023-12-02 08:27:29,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 08:27:29,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 08:27:29,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:27:29,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 08:27:29,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=5116, Unknown=10, NotChecked=290, Total=5700 [2023-12-02 08:27:29,332 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 41 states, 34 states have (on average 2.264705882352941) internal successors, (77), 36 states have internal predecessors, (77), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:27:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:27:31,750 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2023-12-02 08:27:31,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-02 08:27:31,751 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 34 states have (on average 2.264705882352941) internal successors, (77), 36 states have internal predecessors, (77), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2023-12-02 08:27:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:27:31,752 INFO L225 Difference]: With dead ends: 133 [2023-12-02 08:27:31,752 INFO L226 Difference]: Without dead ends: 133 [2023-12-02 08:27:31,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=606, Invalid=8320, Unknown=12, NotChecked=374, Total=9312 [2023-12-02 08:27:31,753 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 213 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 08:27:31,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 773 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 08:27:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-02 08:27:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 102. [2023-12-02 08:27:31,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.35) internal successors, (108), 95 states have internal predecessors, (108), 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 08:27:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2023-12-02 08:27:31,757 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 50 [2023-12-02 08:27:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:27:31,758 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2023-12-02 08:27:31,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 34 states have (on average 2.264705882352941) internal successors, (77), 36 states have internal predecessors, (77), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-02 08:27:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2023-12-02 08:27:31,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 08:27:31,759 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:27:31,759 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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 08:27:31,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 08:27:31,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 08:27:31,960 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2023-12-02 08:27:31,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:27:31,960 INFO L85 PathProgramCache]: Analyzing trace with hash 950684235, now seen corresponding path program 1 times [2023-12-02 08:27:31,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:27:31,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935228201] [2023-12-02 08:27:31,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:27:31,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:27:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:27:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:27:33,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:27:33,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935228201] [2023-12-02 08:27:33,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935228201] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:27:33,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110238236] [2023-12-02 08:27:33,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:27:33,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:27:33,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:27:33,566 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:27:33,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3ac3450-c8ff-49ed-8bd7-aefab4e4e3b8/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 08:27:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:27:33,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-02 08:27:33,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:27:33,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-12-02 08:27:34,175 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 08:27:34,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 08:27:34,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 08:27:34,448 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 08:27:34,448 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 42 treesize of output 39 [2023-12-02 08:27:34,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 08:27:34,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2023-12-02 08:27:34,682 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 08:27:34,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-12-02 08:27:34,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:27:34,786 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 16 treesize of output 11 [2023-12-02 08:27:34,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 08:27:34,803 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-02 08:27:34,803 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 68 treesize of output 51 [2023-12-02 08:27:34,819 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-12-02 08:27:34,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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 08:27:35,002 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 08:27:35,191 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:27:35,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:27:35,379 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| Int) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (or (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_3559))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| v_ArrVal_3558) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_53|) 0)))) is different from false [2023-12-02 08:27:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110238236] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 08:27:35,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [935536339] [2023-12-02 08:27:35,382 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-12-02 08:27:35,382 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 08:27:35,383 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 08:27:35,383 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 08:27:35,383 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 08:27:42,653 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 251 for LOIs [2023-12-02 08:27:44,115 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 08:28:08,152 WARN L293 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 292 DAG size of output: 278 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:28:26,334 WARN L293 SmtUtils]: Spent 9.11s on a formula simplification. DAG size of input: 300 DAG size of output: 286 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:28:44,276 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 314 DAG size of output: 300 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:29:18,442 WARN L293 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 254 DAG size of output: 247 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:29:35,179 WARN L293 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 254 DAG size of output: 247 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:29:52,395 WARN L293 SmtUtils]: Spent 7.31s on a formula simplification. DAG size of input: 268 DAG size of output: 260 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:30:11,849 WARN L293 SmtUtils]: Spent 7.74s on a formula simplification. DAG size of input: 269 DAG size of output: 261 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:30:32,596 WARN L293 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 273 DAG size of output: 265 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:30:59,610 WARN L293 SmtUtils]: Spent 11.83s on a formula simplification. DAG size of input: 288 DAG size of output: 280 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:31:25,940 WARN L293 SmtUtils]: Spent 10.70s on a formula simplification. DAG size of input: 286 DAG size of output: 278 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:32:52,698 WARN L293 SmtUtils]: Spent 48.33s on a formula simplification. DAG size of input: 303 DAG size of output: 295 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:34:36,643 WARN L293 SmtUtils]: Spent 56.29s on a formula simplification. DAG size of input: 312 DAG size of output: 304 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 08:36:20,503 WARN L293 SmtUtils]: Spent 1.08m on a formula simplification. DAG size of input: 306 DAG size of output: 298 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)