./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 cf1a7837 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_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX --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.3-dev-cf1a783 [2023-11-12 00:56:14,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:56:14,867 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:56:14,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:56:14,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:56:14,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:56:14,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:56:14,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:56:14,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:56:14,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:56:14,918 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:56:14,919 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:56:14,920 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:56:14,921 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:56:14,922 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:56:14,922 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:56:14,923 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:56:14,924 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:56:14,924 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:56:14,925 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:56:14,925 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:56:14,926 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:56:14,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:56:14,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:56:14,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:56:14,929 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:56:14,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:56:14,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:56:14,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:56:14,931 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:56:14,932 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:56:14,932 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:56:14,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:56:14,933 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:56:14,933 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:56:14,934 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:56:14,934 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:56:14,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:56:14,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:56:14,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:56:14,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:56:14,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:56:14,936 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:56:14,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:56:14,937 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:56:14,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:56:14,937 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_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/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_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX 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-11-12 00:56:15,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:56:15,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:56:15,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:56:15,336 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:56:15,338 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:56:15,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2023-11-12 00:56:18,427 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:56:18,834 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:56:18,837 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2023-11-12 00:56:18,860 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/data/9d9e2722c/4a7fc149ee67440ca68c01eb756e983f/FLAG279e20505 [2023-11-12 00:56:18,874 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/data/9d9e2722c/4a7fc149ee67440ca68c01eb756e983f [2023-11-12 00:56:18,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:56:18,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:56:18,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:56:18,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:56:18,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:56:18,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:18" (1/1) ... [2023-11-12 00:56:18,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b72e9ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:18, skipping insertion in model container [2023-11-12 00:56:18,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:18" (1/1) ... [2023-11-12 00:56:18,936 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:56:19,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:56:19,286 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:56:19,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:56:19,388 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:56:19,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19 WrapperNode [2023-11-12 00:56:19,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:56:19,390 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:56:19,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:56:19,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:56:19,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,468 INFO L138 Inliner]: procedures = 127, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 146 [2023-11-12 00:56:19,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:56:19,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:56:19,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:56:19,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:56:19,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:56:19,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:56:19,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:56:19,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:56:19,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (1/1) ... [2023-11-12 00:56:19,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:56:19,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:19,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:56:19,546 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:56:19,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:56:19,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:56:19,574 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 00:56:19,574 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 00:56:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:56:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:56:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:56:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:56:19,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:56:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:56:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 00:56:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:56:19,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:56:19,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:56:19,707 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:56:19,709 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:56:20,181 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:56:20,256 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:56:20,256 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 00:56:20,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:20 BoogieIcfgContainer [2023-11-12 00:56:20,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:56:20,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:56:20,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:56:20,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:56:20,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:56:18" (1/3) ... [2023-11-12 00:56:20,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd14488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:20, skipping insertion in model container [2023-11-12 00:56:20,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:19" (2/3) ... [2023-11-12 00:56:20,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd14488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:20, skipping insertion in model container [2023-11-12 00:56:20,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:20" (3/3) ... [2023-11-12 00:56:20,276 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2023-11-12 00:56:20,292 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:56:20,292 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2023-11-12 00:56:20,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:56:20,354 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;@49dd8b8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:56:20,355 INFO L358 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2023-11-12 00:56:20,360 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-11-12 00:56:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:56:20,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:20,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:56:20,378 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-11-12 00:56:20,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:20,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1487525647, now seen corresponding path program 1 times [2023-11-12 00:56:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:20,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343869111] [2023-11-12 00:56:20,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:20,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:20,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343869111] [2023-11-12 00:56:20,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343869111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:20,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:20,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:56:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189135180] [2023-11-12 00:56:20,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:20,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:20,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:20,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:20,734 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-11-12 00:56:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:20,803 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2023-11-12 00:56:20,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:20,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:56:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:20,814 INFO L225 Difference]: With dead ends: 111 [2023-11-12 00:56:20,815 INFO L226 Difference]: Without dead ends: 109 [2023-11-12 00:56:20,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:20,820 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-11-12 00:56:20,821 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-11-12 00:56:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-12 00:56:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2023-11-12 00:56:20,863 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-11-12 00:56:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2023-11-12 00:56:20,888 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 6 [2023-11-12 00:56:20,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:20,888 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2023-11-12 00:56:20,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:56:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2023-11-12 00:56:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:56:20,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:20,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:56:20,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:56:20,891 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-11-12 00:56:20,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:20,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1674136471, now seen corresponding path program 1 times [2023-11-12 00:56:20,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:20,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061670402] [2023-11-12 00:56:20,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:20,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061670402] [2023-11-12 00:56:20,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061670402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:20,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:20,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:56:20,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594365668] [2023-11-12 00:56:20,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:20,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:20,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:21,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:21,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:21,001 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-11-12 00:56:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:21,104 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2023-11-12 00:56:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:21,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:56:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:21,107 INFO L225 Difference]: With dead ends: 93 [2023-11-12 00:56:21,107 INFO L226 Difference]: Without dead ends: 93 [2023-11-12 00:56:21,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:21,109 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-11-12 00:56:21,110 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-11-12 00:56:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-12 00:56:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-12 00:56:21,119 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-11-12 00:56:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2023-11-12 00:56:21,121 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 6 [2023-11-12 00:56:21,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:21,121 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2023-11-12 00:56:21,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:56:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2023-11-12 00:56:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:56:21,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:21,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:56:21,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:56:21,123 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-11-12 00:56:21,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:21,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1674136470, now seen corresponding path program 1 times [2023-11-12 00:56:21,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:21,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034239412] [2023-11-12 00:56:21,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:21,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:21,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:21,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034239412] [2023-11-12 00:56:21,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034239412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:21,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:56:21,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287119388] [2023-11-12 00:56:21,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:21,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:21,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:21,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:21,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:21,263 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-11-12 00:56:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:21,359 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2023-11-12 00:56:21,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:21,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-12 00:56:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:21,361 INFO L225 Difference]: With dead ends: 90 [2023-11-12 00:56:21,361 INFO L226 Difference]: Without dead ends: 90 [2023-11-12 00:56:21,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:21,364 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-11-12 00:56:21,364 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-11-12 00:56:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-12 00:56:21,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-12 00:56:21,372 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-11-12 00:56:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2023-11-12 00:56:21,374 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 6 [2023-11-12 00:56:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:21,374 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2023-11-12 00:56:21,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:56:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2023-11-12 00:56:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:56:21,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:21,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:21,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:56:21,377 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-11-12 00:56:21,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2046686668, now seen corresponding path program 1 times [2023-11-12 00:56:21,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:21,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290120077] [2023-11-12 00:56:21,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:21,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:21,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290120077] [2023-11-12 00:56:21,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290120077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:21,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:21,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:56:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675642269] [2023-11-12 00:56:21,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:21,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:56:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:21,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:56:21,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:21,685 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-11-12 00:56:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:21,914 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2023-11-12 00:56:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:56:21,915 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-11-12 00:56:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:21,916 INFO L225 Difference]: With dead ends: 88 [2023-11-12 00:56:21,916 INFO L226 Difference]: Without dead ends: 88 [2023-11-12 00:56:21,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:56:21,918 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-11-12 00:56:21,919 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-11-12 00:56:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-12 00:56:21,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-12 00:56:21,924 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-11-12 00:56:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2023-11-12 00:56:21,926 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 11 [2023-11-12 00:56:21,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:21,926 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2023-11-12 00:56:21,926 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-11-12 00:56:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2023-11-12 00:56:21,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-12 00:56:21,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:21,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:21,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:56:21,928 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-11-12 00:56:21,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:21,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2046686667, now seen corresponding path program 1 times [2023-11-12 00:56:21,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:21,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50258058] [2023-11-12 00:56:21,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:22,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:22,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50258058] [2023-11-12 00:56:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50258058] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:22,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:22,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:56:22,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748523524] [2023-11-12 00:56:22,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:22,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:56:22,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:22,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:56:22,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:56:22,055 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-11-12 00:56:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:22,272 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2023-11-12 00:56:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:56:22,273 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-11-12 00:56:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:22,275 INFO L225 Difference]: With dead ends: 86 [2023-11-12 00:56:22,275 INFO L226 Difference]: Without dead ends: 86 [2023-11-12 00:56:22,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:56:22,282 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 9 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:22,282 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.2s Time] [2023-11-12 00:56:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-12 00:56:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-12 00:56:22,300 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-11-12 00:56:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-11-12 00:56:22,303 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 11 [2023-11-12 00:56:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:22,304 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-11-12 00:56:22,304 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-11-12 00:56:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-11-12 00:56:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:56:22,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:22,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:56:22,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:56:22,306 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-11-12 00:56:22,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1486749833, now seen corresponding path program 1 times [2023-11-12 00:56:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:22,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269656482] [2023-11-12 00:56:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:22,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:22,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:22,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:22,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269656482] [2023-11-12 00:56:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269656482] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:56:22,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:56:22,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:56:22,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566115990] [2023-11-12 00:56:22,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:56:22,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:56:22,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:22,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:56:22,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:22,400 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-11-12 00:56:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:22,441 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-11-12 00:56:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:56:22,443 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-11-12 00:56:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:22,451 INFO L225 Difference]: With dead ends: 92 [2023-11-12 00:56:22,452 INFO L226 Difference]: Without dead ends: 92 [2023-11-12 00:56:22,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:56:22,459 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-11-12 00:56:22,460 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-11-12 00:56:22,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-12 00:56:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2023-11-12 00:56:22,472 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-11-12 00:56:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2023-11-12 00:56:22,474 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 14 [2023-11-12 00:56:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:22,475 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2023-11-12 00:56:22,475 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-11-12 00:56:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2023-11-12 00:56:22,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-12 00:56:22,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:22,477 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-11-12 00:56:22,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:56:22,477 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-11-12 00:56:22,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:22,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1583400195, now seen corresponding path program 1 times [2023-11-12 00:56:22,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:22,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051260585] [2023-11-12 00:56:22,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:22,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:56:22,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:22,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051260585] [2023-11-12 00:56:22,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051260585] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:22,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877149421] [2023-11-12 00:56:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:22,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:22,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:22,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:22,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:56:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:22,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-12 00:56:22,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:22,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:22,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:56:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877149421] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:56:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2143906281] [2023-11-12 00:56:22,967 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:56:22,968 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:22,972 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:22,978 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:22,978 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:25,770 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 38 for LOIs [2023-11-12 00:56:25,887 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:56:35,309 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1376#(and (<= 1 |#StackHeapBarrier|) (<= 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) (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) (<= 2 |ULTIMATE.start_main_~#s~0#1.base|) (or (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|) (= (select |#valid| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 1) (<= (+ |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|) (<= 12 (select |#length| |ULTIMATE.start_dll_append_~new_last~0#1.base|))) (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|) (= (select |#valid| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 1) (<= (+ |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|) (<= 12 (select |#length| |ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (= 5 |ULTIMATE.start_dll_append_~data#1|))' at error location [2023-11-12 00:56:35,309 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:56:35,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:56:35,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-12 00:56:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697830309] [2023-11-12 00:56:35,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:56:35,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:56:35,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:35,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:56:35,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=352, Unknown=2, NotChecked=0, Total=420 [2023-11-12 00:56:35,313 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:56:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:35,359 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2023-11-12 00:56:35,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:56:35,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2023-11-12 00:56:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:35,360 INFO L225 Difference]: With dead ends: 93 [2023-11-12 00:56:35,361 INFO L226 Difference]: Without dead ends: 93 [2023-11-12 00:56:35,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=66, Invalid=352, Unknown=2, NotChecked=0, Total=420 [2023-11-12 00:56:35,362 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 9 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:35,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 169 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:56:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-12 00:56:35,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-12 00:56:35,376 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-11-12 00:56:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2023-11-12 00:56:35,378 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 24 [2023-11-12 00:56:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:35,378 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2023-11-12 00:56:35,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-12 00:56:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2023-11-12 00:56:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:56:35,380 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:35,380 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-12 00:56:35,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:35,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:35,588 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-11-12 00:56:35,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:35,589 INFO L85 PathProgramCache]: Analyzing trace with hash -649847983, now seen corresponding path program 1 times [2023-11-12 00:56:35,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:35,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770956406] [2023-11-12 00:56:35,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:35,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:36,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:36,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770956406] [2023-11-12 00:56:36,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770956406] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:36,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244113298] [2023-11-12 00:56:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:36,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:36,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:36,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:36,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:56:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:36,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-12 00:56:36,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:36,190 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:56:36,236 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-11-12 00:56:36,283 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:56:36,283 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-12 00:56:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-12 00:56:36,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:36,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244113298] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:36,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [319322973] [2023-11-12 00:56:36,353 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:56:36,354 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:36,354 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:36,356 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:36,356 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:38,038 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 122 for LOIs [2023-11-12 00:56:38,435 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:56:41,980 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1687#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (exists ((|v_#memory_int_77| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_77| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_77| |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))))) (<= 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) (exists ((|v_#memory_$Pointer$.offset_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_99| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_99| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_100| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.offset_100|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_100| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_100| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 0))))) (= |ULTIMATE.start_dll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#memory_$Pointer$.base_99| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_100| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_100| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_100| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 |ULTIMATE.start_dll_create_~head~0#1.base|))) (= (store |v_#memory_$Pointer$.base_99| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_99| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_100| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.base_100|))) (= |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) (= |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-11-12 00:56:41,980 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:56:41,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:56:41,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2023-11-12 00:56:41,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889709260] [2023-11-12 00:56:41,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:56:41,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 00:56:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:41,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 00:56:41,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2023-11-12 00:56:41,983 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:56:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:42,460 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-11-12 00:56:42,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-12 00:56:42,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-11-12 00:56:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:42,462 INFO L225 Difference]: With dead ends: 92 [2023-11-12 00:56:42,462 INFO L226 Difference]: Without dead ends: 92 [2023-11-12 00:56:42,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=132, Invalid=741, Unknown=1, NotChecked=56, Total=930 [2023-11-12 00:56:42,464 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 11 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:42,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 374 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 393 Invalid, 0 Unknown, 96 Unchecked, 0.3s Time] [2023-11-12 00:56:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-12 00:56:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-12 00:56:42,469 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-11-12 00:56:42,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2023-11-12 00:56:42,470 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 27 [2023-11-12 00:56:42,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:42,471 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2023-11-12 00:56:42,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-12 00:56:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2023-11-12 00:56:42,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-12 00:56:42,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:42,472 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-12 00:56:42,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:42,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:42,679 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-11-12 00:56:42,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash -649847982, now seen corresponding path program 1 times [2023-11-12 00:56:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:42,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386570184] [2023-11-12 00:56:42,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:42,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:43,236 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:43,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386570184] [2023-11-12 00:56:43,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386570184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:43,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317793208] [2023-11-12 00:56:43,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:43,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:43,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:43,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:43,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:56:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:43,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-12 00:56:43,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:43,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:56:43,561 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:56:43,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-12 00:56:43,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:56:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:43,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:43,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317793208] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:43,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [390954986] [2023-11-12 00:56:43,763 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-11-12 00:56:43,764 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:43,764 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:43,764 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:43,764 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:45,311 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 122 for LOIs [2023-11-12 00:56:45,602 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:56:49,566 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2006#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_create_~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_dll_create_~len#1| 2) (= |ULTIMATE.start_main_~data~0#1| 1) (exists ((|v_#memory_$Pointer$.offset_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_120| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_120| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_120| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 0))) (= (store |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_119| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_120| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.offset_120|))) (= |ULTIMATE.start_dll_create_#in~data#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (exists ((|v_#memory_int_97| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_97| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_97| |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$.base_119| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_120| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.base_120| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_120| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 4 |ULTIMATE.start_dll_create_~head~0#1.base|)) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_119| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_119| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select (select |v_#memory_$Pointer$.base_120| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) |v_#memory_$Pointer$.base_120|))) (= |ULTIMATE.start_dll_create_~data#1| 1))' at error location [2023-11-12 00:56:49,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:56:49,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 00:56:49,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 14 [2023-11-12 00:56:49,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158665793] [2023-11-12 00:56:49,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 00:56:49,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-12 00:56:49,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:56:49,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-12 00:56:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2023-11-12 00:56:49,569 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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-11-12 00:56:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:56:50,309 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2023-11-12 00:56:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:56:50,310 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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 27 [2023-11-12 00:56:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:56:50,311 INFO L225 Difference]: With dead ends: 92 [2023-11-12 00:56:50,311 INFO L226 Difference]: Without dead ends: 92 [2023-11-12 00:56:50,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2023-11-12 00:56:50,313 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:56:50,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 442 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 00:56:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-12 00:56:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2023-11-12 00:56:50,319 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-11-12 00:56:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2023-11-12 00:56:50,321 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 27 [2023-11-12 00:56:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:56:50,322 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2023-11-12 00:56:50,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 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-11-12 00:56:50,322 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2023-11-12 00:56:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-12 00:56:50,323 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:56:50,323 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-11-12 00:56:50,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:56:50,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:50,530 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-11-12 00:56:50,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:56:50,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1751614523, now seen corresponding path program 2 times [2023-11-12 00:56:50,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:56:50,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438855950] [2023-11-12 00:56:50,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:56:50,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:56:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:56:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-12 00:56:50,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:56:50,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438855950] [2023-11-12 00:56:50,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438855950] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:56:50,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725787211] [2023-11-12 00:56:50,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-12 00:56:50,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:56:50,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:56:50,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:56:50,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:56:50,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-12 00:56:50,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 00:56:50,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 00:56:50,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:56:50,995 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:56:51,024 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-11-12 00:56:51,048 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-12 00:56:51,059 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 00:56:51,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-12 00:56:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 7 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:56:51,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:56:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:56:51,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725787211] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:56:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1974523336] [2023-11-12 00:56:51,229 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-12 00:56:51,229 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:56:51,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:56:51,229 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:56:51,230 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:56:52,909 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 165 for LOIs [2023-11-12 00:56:53,482 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:57:11,207 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2441#(and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_dll_append_#in~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (= |ULTIMATE.start_dll_append_#in~data#1| 5) (or (and (exists ((|v_#memory_$Pointer$.base_157| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_156| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_dll_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_157| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_157| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_$Pointer$.base_156| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_156| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_157| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_157|))) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_128|) (= (store |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_129| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_129|) (= |#memory_int| (store |v_#memory_int_129| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_129| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 5))))) (exists ((|v_old(#valid)_AFTER_CALL_36| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_36| |ULTIMATE.start_dll_create_#res#1.base|) 1)) (exists ((|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_149| |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))))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 1) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_134| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |v_#memory_int_134| |ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_134| |ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_36| |ULTIMATE.start_dll_create_#res#1.base|) 4))))) (<= (+ |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_149| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_149| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_149| |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_156| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_157| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_156| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_156| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_157| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_157|) (= (select (select (store |v_#memory_$Pointer$.offset_157| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_157| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_#length_BEFORE_CALL_60| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_60| |ULTIMATE.start_dll_create_#res#1.base|))) (exists ((|v_#valid_137| (Array Int Int))) (and (= |#valid| (store |v_#valid_137| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1)) (= (select |v_#valid_137| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (exists ((|v_#length_114| (Array Int Int))) (= (store |v_#length_114| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (<= 12 (select |#length| |ULTIMATE.start_dll_append_~new_last~0#1.base|))) (and (exists ((|v_#memory_$Pointer$.base_157| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_156| (Array Int (Array Int Int)))) (and (= |ULTIMATE.start_dll_create_#res#1.base| (select (select (store |v_#memory_$Pointer$.base_157| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_157| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0)) (= (store |v_#memory_$Pointer$.base_156| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_156| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.base_157| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.base_157|))) (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_127| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4 (select (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 4))) |v_#memory_int_128|) (= (store |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_128| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8 (select (select |v_#memory_int_129| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 8))) |v_#memory_int_129|) (= |#memory_int| (store |v_#memory_int_129| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (select |v_#memory_int_129| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0 5))))) (exists ((|v_#length_BEFORE_CALL_62| (Array Int Int))) (<= 8 (select |v_#length_BEFORE_CALL_62| |ULTIMATE.start_dll_create_#res#1.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_37| (Array Int (Array Int Int))) (|v_#memory_int_134| (Array Int (Array Int Int)))) (= |v_old(#memory_int)_AFTER_CALL_37| (store |v_#memory_int_134| |ULTIMATE.start_dll_create_#res#1.base| (store (store (select |v_#memory_int_134| |ULTIMATE.start_dll_create_#res#1.base|) 0 1) 4 (select (select |v_old(#memory_int)_AFTER_CALL_37| |ULTIMATE.start_dll_create_#res#1.base|) 4))))) (exists ((|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_149| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.offset_149| |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))))) (= |ULTIMATE.start_dll_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 1) (<= (+ |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_149| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_149| |ULTIMATE.start_dll_append_~new_last~0#1.base| (store (store (store (select |v_#memory_$Pointer$.base_149| |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_156| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_157| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$.offset_156| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_156| |ULTIMATE.start_dll_create_#res#1.base|) 0 (select (select |v_#memory_$Pointer$.offset_157| |ULTIMATE.start_dll_create_#res#1.base|) 0))) |v_#memory_$Pointer$.offset_157|) (= (select (select (store |v_#memory_$Pointer$.offset_157| |ULTIMATE.start_dll_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_157| |ULTIMATE.start_dll_create_#res#1.base|) 4 0)) |ULTIMATE.start_main_~#s~0#1.base|) 0) 0))) (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_37| |ULTIMATE.start_dll_create_#res#1.base|) 1)) (exists ((|v_#valid_137| (Array Int Int))) (and (= |#valid| (store |v_#valid_137| |ULTIMATE.start_dll_append_~new_last~0#1.base| 1)) (= (select |v_#valid_137| |ULTIMATE.start_dll_append_~new_last~0#1.base|) 0))) (= |ULTIMATE.start_dll_append_~head#1.base| |ULTIMATE.start_dll_append_#in~head#1.base|) (exists ((|v_#length_114| (Array Int Int))) (= (store |v_#length_114| |ULTIMATE.start_dll_append_~new_last~0#1.base| 12) |#length|)) (<= 12 (select |#length| |ULTIMATE.start_dll_append_~new_last~0#1.base|)))) (= |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) (= |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-11-12 00:57:11,207 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:57:11,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:57:11,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2023-11-12 00:57:11,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679715331] [2023-11-12 00:57:11,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:57:11,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 00:57:11,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:57:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 00:57:11,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=622, Unknown=8, NotChecked=50, Total=756 [2023-11-12 00:57:11,211 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-11-12 00:57:11,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:57:11,762 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2023-11-12 00:57:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-12 00:57:11,763 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-11-12 00:57:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:57:11,764 INFO L225 Difference]: With dead ends: 91 [2023-11-12 00:57:11,764 INFO L226 Difference]: Without dead ends: 91 [2023-11-12 00:57:11,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=132, Invalid=1051, Unknown=11, NotChecked=66, Total=1260 [2023-11-12 00:57:11,765 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 171 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:57:11,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 309 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 355 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2023-11-12 00:57:11,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-12 00:57:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-12 00:57:11,769 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-11-12 00:57:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2023-11-12 00:57:11,771 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 37 [2023-11-12 00:57:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:57:11,772 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2023-11-12 00:57:11,772 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-11-12 00:57:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2023-11-12 00:57:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-12 00:57:11,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:57:11,774 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-11-12 00:57:11,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:57:11,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:11,981 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-11-12 00:57:11,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:57:11,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1354314847, now seen corresponding path program 1 times [2023-11-12 00:57:11,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:57:11,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447030499] [2023-11-12 00:57:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:11,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:57:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 00:57:12,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:57:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447030499] [2023-11-12 00:57:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447030499] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:57:12,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818732512] [2023-11-12 00:57:12,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:57:12,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:57:12,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:57:12,654 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:57:12,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4bd93a80-a108-4db3-8158-d962c7e6be2a/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:57:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:57:12,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-12 00:57:12,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:57:12,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:57:12,907 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:57:12,907 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-11-12 00:57:13,032 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:57:13,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2023-11-12 00:57:13,202 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-11-12 00:57:13,225 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-12 00:57:13,226 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-12 00:57:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2023-11-12 00:57:13,246 INFO L327 TraceCheckSpWp]: Computing backward predicates...