./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91 --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 64bit --witnessprinter.graph.data.programhash 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 23:20:39,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 23:20:39,539 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-11-24 23:20:39,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 23:20:39,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 23:20:39,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 23:20:39,569 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 23:20:39,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 23:20:39,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 23:20:39,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 23:20:39,572 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-24 23:20:39,573 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-24 23:20:39,573 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-24 23:20:39,574 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-24 23:20:39,574 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-24 23:20:39,575 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-24 23:20:39,575 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-24 23:20:39,576 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-24 23:20:39,576 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-24 23:20:39,577 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-24 23:20:39,578 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-24 23:20:39,578 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-24 23:20:39,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 23:20:39,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 23:20:39,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 23:20:39,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 23:20:39,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 23:20:39,581 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 23:20:39,582 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 23:20:39,582 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 23:20:39,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 23:20:39,583 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 23:20:39,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 23:20:39,584 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 23:20:39,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 23:20:39,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 23:20:39,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 23:20:39,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:20:39,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 23:20:39,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 23:20:39,586 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-24 23:20:39,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 23:20:39,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 23:20:39,586 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-24 23:20:39,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 23:20:39,587 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_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/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_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e [2023-11-24 23:20:39,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 23:20:39,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 23:20:39,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 23:20:39,911 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 23:20:39,912 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 23:20:39,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2023-11-24 23:20:43,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 23:20:43,332 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 23:20:43,333 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2023-11-24 23:20:43,362 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/data/27b76a7b5/e4e297b095204e00a9aca7942aeebaf8/FLAG1e1f9c83a [2023-11-24 23:20:43,376 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/data/27b76a7b5/e4e297b095204e00a9aca7942aeebaf8 [2023-11-24 23:20:43,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 23:20:43,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 23:20:43,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 23:20:43,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 23:20:43,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 23:20:43,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:43,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4627d6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43, skipping insertion in model container [2023-11-24 23:20:43,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:43,474 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 23:20:43,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:20:43,856 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 23:20:43,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 23:20:43,928 INFO L206 MainTranslator]: Completed translation [2023-11-24 23:20:43,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43 WrapperNode [2023-11-24 23:20:43,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 23:20:43,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 23:20:43,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 23:20:43,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 23:20:43,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:43,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:43,981 INFO L138 Inliner]: procedures = 122, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 89 [2023-11-24 23:20:43,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 23:20:43,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 23:20:43,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 23:20:43,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 23:20:43,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:43,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:43,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:43,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:44,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:44,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:44,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:44,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:44,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 23:20:44,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 23:20:44,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 23:20:44,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 23:20:44,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (1/1) ... [2023-11-24 23:20:44,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 23:20:44,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:20:44,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 23:20:44,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 23:20:44,117 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2023-11-24 23:20:44,118 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2023-11-24 23:20:44,118 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2023-11-24 23:20:44,118 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2023-11-24 23:20:44,118 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2023-11-24 23:20:44,119 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2023-11-24 23:20:44,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 23:20:44,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-24 23:20:44,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 23:20:44,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 23:20:44,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 23:20:44,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 23:20:44,276 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 23:20:44,278 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 23:20:44,726 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 23:20:44,825 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 23:20:44,826 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-24 23:20:44,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:20:44 BoogieIcfgContainer [2023-11-24 23:20:44,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 23:20:44,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 23:20:44,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 23:20:44,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 23:20:44,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 11:20:43" (1/3) ... [2023-11-24 23:20:44,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f93ad81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:20:44, skipping insertion in model container [2023-11-24 23:20:44,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 11:20:43" (2/3) ... [2023-11-24 23:20:44,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f93ad81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 11:20:44, skipping insertion in model container [2023-11-24 23:20:44,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 11:20:44" (3/3) ... [2023-11-24 23:20:44,839 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-sll.i [2023-11-24 23:20:44,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 23:20:44,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-24 23:20:44,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 23:20:44,902 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;@2a76bbed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 23:20:44,902 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2023-11-24 23:20:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 38 states have (on average 2.236842105263158) internal successors, (85), 77 states have internal predecessors, (85), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:20:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-24 23:20:44,911 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:44,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-24 23:20:44,912 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:20:44,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash 6991277, now seen corresponding path program 1 times [2023-11-24 23:20:44,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:44,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163522041] [2023-11-24 23:20:44,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:44,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:45,215 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-24 23:20:45,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:45,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163522041] [2023-11-24 23:20:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163522041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:20:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208967338] [2023-11-24 23:20:45,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:45,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:20:45,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:45,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:20:45,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:20:45,272 INFO L87 Difference]: Start difference. First operand has 87 states, 38 states have (on average 2.236842105263158) internal successors, (85), 77 states have internal predecessors, (85), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-24 23:20:45,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:45,465 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2023-11-24 23:20:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:20:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2023-11-24 23:20:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:45,477 INFO L225 Difference]: With dead ends: 85 [2023-11-24 23:20:45,477 INFO L226 Difference]: Without dead ends: 84 [2023-11-24 23:20:45,479 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-24 23:20:45,483 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 4 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:45,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:20:45,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-24 23:20:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-24 23:20:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 74 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:20:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2023-11-24 23:20:45,526 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 4 [2023-11-24 23:20:45,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:45,526 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2023-11-24 23:20:45,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-24 23:20:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2023-11-24 23:20:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-24 23:20:45,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:45,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-24 23:20:45,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 23:20:45,528 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:20:45,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:45,529 INFO L85 PathProgramCache]: Analyzing trace with hash 6991278, now seen corresponding path program 1 times [2023-11-24 23:20:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:45,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250213859] [2023-11-24 23:20:45,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:45,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:45,626 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-24 23:20:45,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:45,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250213859] [2023-11-24 23:20:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250213859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:45,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:45,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:20:45,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800921899] [2023-11-24 23:20:45,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:45,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:20:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:45,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:20:45,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:20:45,631 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-24 23:20:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:45,710 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2023-11-24 23:20:45,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:20:45,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2023-11-24 23:20:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:45,712 INFO L225 Difference]: With dead ends: 82 [2023-11-24 23:20:45,712 INFO L226 Difference]: Without dead ends: 82 [2023-11-24 23:20:45,713 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-24 23:20:45,714 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:45,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 117 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:20:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-24 23:20:45,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-24 23:20:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 72 states have internal predecessors, (78), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:20:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2023-11-24 23:20:45,725 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 4 [2023-11-24 23:20:45,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:45,726 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2023-11-24 23:20:45,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-24 23:20:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2023-11-24 23:20:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 23:20:45,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:45,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:45,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 23:20:45,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:20:45,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash -939442667, now seen corresponding path program 1 times [2023-11-24 23:20:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:45,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399560254] [2023-11-24 23:20:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:45,855 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-24 23:20:45,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:45,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399560254] [2023-11-24 23:20:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399560254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:45,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:20:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76109429] [2023-11-24 23:20:45,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:45,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:20:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:45,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:20:45,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:20:45,859 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:20:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:45,952 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2023-11-24 23:20:45,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:20:45,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-24 23:20:45,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:45,954 INFO L225 Difference]: With dead ends: 81 [2023-11-24 23:20:45,955 INFO L226 Difference]: Without dead ends: 81 [2023-11-24 23:20:45,955 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-24 23:20:45,957 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:45,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 110 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:20:45,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-24 23:20:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-24 23:20:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 38 states have (on average 2.026315789473684) internal successors, (77), 71 states have internal predecessors, (77), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:20:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2023-11-24 23:20:45,968 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 11 [2023-11-24 23:20:45,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:45,969 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2023-11-24 23:20:45,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:20:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2023-11-24 23:20:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-24 23:20:45,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:45,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:45,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 23:20:45,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:20:45,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash -939442666, now seen corresponding path program 1 times [2023-11-24 23:20:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:45,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641101506] [2023-11-24 23:20:45,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:45,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:46,142 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-24 23:20:46,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:46,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641101506] [2023-11-24 23:20:46,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641101506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:46,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 23:20:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751652343] [2023-11-24 23:20:46,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:46,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 23:20:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:46,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 23:20:46,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 23:20:46,147 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:20:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:46,241 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2023-11-24 23:20:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 23:20:46,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-24 23:20:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:46,246 INFO L225 Difference]: With dead ends: 80 [2023-11-24 23:20:46,246 INFO L226 Difference]: Without dead ends: 80 [2023-11-24 23:20:46,247 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-24 23:20:46,257 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:46,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:20:46,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-24 23:20:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-24 23:20:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 38 states have (on average 2.0) internal successors, (76), 70 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-24 23:20:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2023-11-24 23:20:46,270 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 11 [2023-11-24 23:20:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:46,270 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2023-11-24 23:20:46,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-24 23:20:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2023-11-24 23:20:46,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-24 23:20:46,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:46,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:46,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 23:20:46,272 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:20:46,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:46,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149562, now seen corresponding path program 1 times [2023-11-24 23:20:46,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:46,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278007269] [2023-11-24 23:20:46,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:46,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:46,675 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-24 23:20:46,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278007269] [2023-11-24 23:20:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278007269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:46,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:46,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 23:20:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989669293] [2023-11-24 23:20:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:46,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 23:20:46,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:46,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 23:20:46,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-24 23:20:46,683 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:20:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:47,129 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2023-11-24 23:20:47,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 23:20:47,130 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 18 [2023-11-24 23:20:47,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:47,133 INFO L225 Difference]: With dead ends: 97 [2023-11-24 23:20:47,133 INFO L226 Difference]: Without dead ends: 97 [2023-11-24 23:20:47,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-24 23:20:47,139 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:47,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 222 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:20:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-24 23:20:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2023-11-24 23:20:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 77 states have internal predecessors, (91), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-24 23:20:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2023-11-24 23:20:47,160 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 18 [2023-11-24 23:20:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:47,160 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2023-11-24 23:20:47,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:20:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2023-11-24 23:20:47,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-24 23:20:47,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:47,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:47,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 23:20:47,162 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:20:47,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:47,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149563, now seen corresponding path program 1 times [2023-11-24 23:20:47,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:47,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474058560] [2023-11-24 23:20:47,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:47,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:47,582 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-24 23:20:47,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:47,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474058560] [2023-11-24 23:20:47,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474058560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:20:47,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:20:47,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 23:20:47,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772020970] [2023-11-24 23:20:47,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:20:47,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 23:20:47,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:47,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 23:20:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-24 23:20:47,590 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:20:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:48,130 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2023-11-24 23:20:48,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 23:20:48,131 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 18 [2023-11-24 23:20:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:48,132 INFO L225 Difference]: With dead ends: 102 [2023-11-24 23:20:48,132 INFO L226 Difference]: Without dead ends: 102 [2023-11-24 23:20:48,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-24 23:20:48,133 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 18 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:48,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 276 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:20:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-24 23:20:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2023-11-24 23:20:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 83 states have internal predecessors, (99), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-24 23:20:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2023-11-24 23:20:48,143 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 18 [2023-11-24 23:20:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:48,143 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2023-11-24 23:20:48,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-24 23:20:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2023-11-24 23:20:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-24 23:20:48,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:48,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:48,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 23:20:48,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:20:48,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:48,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1711403091, now seen corresponding path program 1 times [2023-11-24 23:20:48,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:48,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991435694] [2023-11-24 23:20:48,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:48,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:20:48,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:48,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991435694] [2023-11-24 23:20:48,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991435694] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:20:48,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194390393] [2023-11-24 23:20:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:48,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:20:48,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:20:48,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:20:48,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 23:20:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:48,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-24 23:20:48,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:20:48,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:20:48,564 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-24 23:20:48,608 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 23:20:48,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 23:20:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 23:20:48,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:20:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194390393] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:20:48,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [616740717] [2023-11-24 23:20:48,702 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:20:48,702 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:20:48,707 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:20:48,714 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:20:48,714 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:20:48,894 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 52 for LOIs [2023-11-24 23:20:49,479 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 96 for LOIs [2023-11-24 23:20:49,615 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-24 23:20:49,638 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:20:54,354 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1249#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (= create_internal_~now~0.offset 0) (not (= (select |#valid| create_internal_~now~0.base) 1)) (= |create_internal_#t~ret7.offset| 0) (or (and (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#length_86| (Array Int Int))) (= |#length| (store |v_#length_86| |create_internal_#t~ret7.base| 8))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| 0) 0)) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_90| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_90| |create_internal_#t~ret7.base|) 0 0)) |#memory_$Pointer$.base|)) (exists ((|v_#valid_104| (Array Int Int))) (= (select |v_#valid_104| create_internal_~sll~0.base) 0)) (exists ((|v_#memory_$Pointer$.offset_91| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_91| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_91| |create_internal_#t~ret7.base|) 0 0)))) (not (= create_internal_~sll~0.base 0)) (exists ((|v_#memory_$Pointer$.base_88| (Array Int (Array Int Int))) (|v_#valid_103| (Array Int Int)) (|v_#memory_$Pointer$.offset_88| (Array Int (Array Int Int))) (|v_#length_85| (Array Int Int)) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| Int)) (and (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0))) (= (store |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0)) |old(#memory_$Pointer$.base)|) (= (store |v_#length_85| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 16) |old(#length)|) (= |old(#valid)| (store |v_#valid_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1)) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1) |#StackHeapBarrier|) (= (select |v_#valid_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 0)))) (= create_internal_~now~0.base create_internal_~sll~0.base) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_create_internal_#t~nondet6_6| Int)) (and (<= 0 (+ |v_create_internal_#t~nondet6_6| 2147483648)) (<= |v_create_internal_#t~nondet6_6| 2147483647) (not (= |v_create_internal_#t~nondet6_6| 0)))) (exists ((|v_#valid_105| (Array Int Int))) (and (= (select |v_#valid_105| |create_internal_#t~ret7.base|) 0) (= |#valid| (store |v_#valid_105| |create_internal_#t~ret7.base| 1))))) (and (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_92| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_92| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_92| |create_internal_#t~ret7.base|) 0 0)) |#memory_$Pointer$.base|)) (exists ((|v_#memory_$Pointer$.offset_92| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_92| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_92| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_#length_86| (Array Int Int))) (= |#length| (store |v_#length_86| |create_internal_#t~ret7.base| 8))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_3| 0) 0)) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_#valid_104| (Array Int Int))) (= (select |v_#valid_104| create_internal_~sll~0.base) 0)) (not (= create_internal_~sll~0.base 0)) (exists ((|v_#memory_$Pointer$.base_88| (Array Int (Array Int Int))) (|v_#valid_103| (Array Int Int)) (|v_#memory_$Pointer$.offset_88| (Array Int (Array Int Int))) (|v_#length_85| (Array Int Int)) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| Int)) (and (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (select |v_#memory_$Pointer$.offset_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0))) (= (store |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| (store (store (select |v_#memory_$Pointer$.base_88| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0 0) 8 0)) |old(#memory_$Pointer$.base)|) (= (store |v_#length_85| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 16) |old(#length)|) (= |old(#valid)| (store |v_#valid_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1)) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 1) |#StackHeapBarrier|) (= (select |v_#valid_103| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1|) 0) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_1| 0)))) (= create_internal_~now~0.base create_internal_~sll~0.base) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_106| (Array Int Int))) (and (= (select |v_#valid_106| |create_internal_#t~ret7.base|) 0) (= (store |v_#valid_106| |create_internal_#t~ret7.base| 1) |#valid|))) (exists ((|v_create_internal_#t~nondet6_6| Int)) (and (<= 0 (+ |v_create_internal_#t~nondet6_6| 2147483648)) (<= |v_create_internal_#t~nondet6_6| 2147483647) (not (= |v_create_internal_#t~nondet6_6| 0)))))))' at error location [2023-11-24 23:20:54,355 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:20:54,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:20:54,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2023-11-24 23:20:54,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885792536] [2023-11-24 23:20:54,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:20:54,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 23:20:54,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:20:54,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 23:20:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=571, Unknown=2, NotChecked=48, Total=702 [2023-11-24 23:20:54,358 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-24 23:20:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:20:55,017 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2023-11-24 23:20:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 23:20:55,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2023-11-24 23:20:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:20:55,020 INFO L225 Difference]: With dead ends: 100 [2023-11-24 23:20:55,020 INFO L226 Difference]: Without dead ends: 100 [2023-11-24 23:20:55,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=105, Invalid=767, Unknown=2, NotChecked=56, Total=930 [2023-11-24 23:20:55,022 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:20:55,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 253 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 323 Invalid, 0 Unknown, 94 Unchecked, 0.4s Time] [2023-11-24 23:20:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-24 23:20:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2023-11-24 23:20:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 83 states have internal predecessors, (100), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-24 23:20:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2023-11-24 23:20:55,044 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 20 [2023-11-24 23:20:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:20:55,044 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2023-11-24 23:20:55,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-24 23:20:55,045 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2023-11-24 23:20:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-24 23:20:55,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:20:55,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:20:55,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 23:20:55,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:20:55,256 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:20:55,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:20:55,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1711403090, now seen corresponding path program 1 times [2023-11-24 23:20:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:20:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351441553] [2023-11-24 23:20:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:20:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 23:20:55,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:20:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351441553] [2023-11-24 23:20:55,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351441553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:20:55,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129191661] [2023-11-24 23:20:55,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:20:55,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:20:55,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:20:55,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:20:55,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 23:20:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:20:55,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-24 23:20:55,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:20:55,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:20:56,120 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-24 23:20:56,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:20:56,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-24 23:20:56,154 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:20:56,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 23:20:56,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 23:20:56,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:20:56,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129191661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:20:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [667387289] [2023-11-24 23:20:56,331 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-24 23:20:56,331 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:20:56,332 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:20:56,332 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:20:56,332 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:20:56,427 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 52 for LOIs [2023-11-24 23:20:56,829 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 94 for LOIs [2023-11-24 23:20:56,920 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-24 23:20:56,938 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:21:01,727 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1552#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (= create_internal_~now~0.offset 0) (<= (select |#length| create_internal_~now~0.base) 7) (= |create_internal_#t~ret7.offset| 0) (or (and (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_104| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_104| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_104| |create_internal_#t~ret7.base|) 0 0)))) (exists ((|v_#length_98| (Array Int Int)) (|v_#valid_116| (Array Int Int)) (|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| Int) (|v_#memory_$Pointer$.base_100| (Array Int (Array Int Int)))) (and (= |old(#length)| (store |v_#length_98| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 16)) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 0)) (= (select |v_#valid_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0) (= (store |v_#valid_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1) |old(#valid)|) (= (store |v_#memory_$Pointer$.base_100| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (select |v_#memory_$Pointer$.base_100| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0)) |old(#memory_$Pointer$.base)|) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (select |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0))) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|))) (exists ((|v_#valid_117| (Array Int Int))) (and (= (select |v_#valid_117| |create_internal_#t~ret7.base|) 0) (= (store |v_#valid_117| |create_internal_#t~ret7.base| 1) |#valid|))) (exists ((|v_#valid_119| (Array Int Int))) (= (select |v_#valid_119| create_internal_~sll~0.base) 0)) (exists ((|v_#memory_$Pointer$.base_102| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_102| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_102| |create_internal_#t~ret7.base|) 0 0)))) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_create_internal_#t~nondet6_7| Int)) (and (not (= |v_create_internal_#t~nondet6_7| 0)) (<= 0 (+ |v_create_internal_#t~nondet6_7| 2147483648)) (<= |v_create_internal_#t~nondet6_7| 2147483647))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 0) 0)) (not (= create_internal_~sll~0.base 0)) (= create_internal_~now~0.base create_internal_~sll~0.base) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_#length_101| (Array Int Int))) (= |#length| (store |v_#length_101| |create_internal_#t~ret7.base| 8)))) (and (<= (+ create_internal_~sll~0.base 1) |#StackHeapBarrier|) (exists ((|v_#valid_118| (Array Int Int))) (= 0 (select |v_#valid_118| create_internal_~sll~0.base))) (exists ((|v_#memory_$Pointer$.base_103| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_103| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_103| |create_internal_#t~ret7.base|) 0 0)) |#memory_$Pointer$.base|)) (exists ((|v_#length_98| (Array Int Int)) (|v_#valid_116| (Array Int Int)) (|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| Int) (|v_#memory_$Pointer$.base_100| (Array Int (Array Int Int)))) (and (= |old(#length)| (store |v_#length_98| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 16)) (not (= |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 0)) (= (select |v_#valid_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0) (= (store |v_#valid_116| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1) |old(#valid)|) (= (store |v_#memory_$Pointer$.base_100| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (select |v_#memory_$Pointer$.base_100| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0)) |old(#memory_$Pointer$.base)|) (= |old(#memory_$Pointer$.offset)| (store |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| (store (store (select |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2|) 0 0) 8 0))) (<= (+ |v_ULTIMATE.start_create_~now~1#1.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|))) (exists ((|v_#valid_117| (Array Int Int))) (and (= (select |v_#valid_117| |create_internal_#t~ret7.base|) 0) (= (store |v_#valid_117| |create_internal_#t~ret7.base| 1) |#valid|))) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_create_internal_#t~nondet6_7| Int)) (and (not (= |v_create_internal_#t~nondet6_7| 0)) (<= 0 (+ |v_create_internal_#t~nondet6_7| 2147483648)) (<= |v_create_internal_#t~nondet6_7| 2147483647))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| (Array Int Int))) (= (select |v_ULTIMATE.start_main_old_#valid#1_BEFORE_CALL_7| 0) 0)) (not (= create_internal_~sll~0.base 0)) (exists ((|v_#length_99| (Array Int Int))) (= |#length| (store |v_#length_99| |create_internal_#t~ret7.base| 8))) (= create_internal_~now~0.base create_internal_~sll~0.base) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_103| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_103| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_103| |create_internal_#t~ret7.base|) 0 0)))))))' at error location [2023-11-24 23:21:01,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:21:01,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:21:01,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-11-24 23:21:01,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292421386] [2023-11-24 23:21:01,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:21:01,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-24 23:21:01,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:21:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-24 23:21:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=892, Unknown=2, NotChecked=60, Total=1056 [2023-11-24 23:21:01,731 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 16 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-24 23:21:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:21:02,385 INFO L93 Difference]: Finished difference Result 99 states and 122 transitions. [2023-11-24 23:21:02,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 23:21:02,386 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20 [2023-11-24 23:21:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:21:02,387 INFO L225 Difference]: With dead ends: 99 [2023-11-24 23:21:02,387 INFO L226 Difference]: Without dead ends: 99 [2023-11-24 23:21:02,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=141, Invalid=1192, Unknown=3, NotChecked=70, Total=1406 [2023-11-24 23:21:02,390 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 16 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:21:02,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 420 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 489 Invalid, 0 Unknown, 93 Unchecked, 0.4s Time] [2023-11-24 23:21:02,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-24 23:21:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2023-11-24 23:21:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 82 states have internal predecessors, (98), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-24 23:21:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2023-11-24 23:21:02,408 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 20 [2023-11-24 23:21:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:21:02,410 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2023-11-24 23:21:02,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-24 23:21:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2023-11-24 23:21:02,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-24 23:21:02,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:21:02,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:21:02,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 23:21:02,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:21:02,618 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:21:02,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:21:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash -222925609, now seen corresponding path program 1 times [2023-11-24 23:21:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:21:02,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562434834] [2023-11-24 23:21:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:02,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:21:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:02,712 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-24 23:21:02,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:21:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562434834] [2023-11-24 23:21:02,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562434834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:21:02,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:21:02,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 23:21:02,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738102165] [2023-11-24 23:21:02,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:21:02,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 23:21:02,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:21:02,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 23:21:02,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 23:21:02,715 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:21:02,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:21:02,868 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2023-11-24 23:21:02,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 23:21:02,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-11-24 23:21:02,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:21:02,870 INFO L225 Difference]: With dead ends: 117 [2023-11-24 23:21:02,870 INFO L226 Difference]: Without dead ends: 117 [2023-11-24 23:21:02,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-24 23:21:02,871 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:21:02,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 165 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:21:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-24 23:21:02,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2023-11-24 23:21:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 64 states have (on average 1.84375) internal successors, (118), 90 states have internal predecessors, (118), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-24 23:21:02,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 144 transitions. [2023-11-24 23:21:02,878 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 144 transitions. Word has length 23 [2023-11-24 23:21:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:21:02,878 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 144 transitions. [2023-11-24 23:21:02,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:21:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 144 transitions. [2023-11-24 23:21:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-24 23:21:02,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:21:02,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:21:02,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 23:21:02,881 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:21:02,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:21:02,881 INFO L85 PathProgramCache]: Analyzing trace with hash -222925608, now seen corresponding path program 1 times [2023-11-24 23:21:02,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:21:02,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001841782] [2023-11-24 23:21:02,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:21:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:03,078 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-24 23:21:03,078 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:21:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001841782] [2023-11-24 23:21:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001841782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:21:03,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:21:03,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 23:21:03,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563590952] [2023-11-24 23:21:03,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:21:03,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 23:21:03,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:21:03,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 23:21:03,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:21:03,081 INFO L87 Difference]: Start difference. First operand 108 states and 144 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:21:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:21:03,293 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2023-11-24 23:21:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 23:21:03,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-11-24 23:21:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:21:03,297 INFO L225 Difference]: With dead ends: 122 [2023-11-24 23:21:03,297 INFO L226 Difference]: Without dead ends: 122 [2023-11-24 23:21:03,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-24 23:21:03,298 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-24 23:21:03,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 336 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-24 23:21:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-24 23:21:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2023-11-24 23:21:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 70 states have (on average 1.8285714285714285) internal successors, (128), 96 states have internal predecessors, (128), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-24 23:21:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 154 transitions. [2023-11-24 23:21:03,307 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 154 transitions. Word has length 23 [2023-11-24 23:21:03,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:21:03,308 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 154 transitions. [2023-11-24 23:21:03,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:21:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2023-11-24 23:21:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-24 23:21:03,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:21:03,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:21:03,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 23:21:03,311 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:21:03,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:21:03,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1679385118, now seen corresponding path program 1 times [2023-11-24 23:21:03,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:21:03,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201380291] [2023-11-24 23:21:03,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:03,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:21:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:03,423 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-24 23:21:03,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:21:03,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201380291] [2023-11-24 23:21:03,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201380291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:21:03,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:21:03,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-24 23:21:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168078759] [2023-11-24 23:21:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:21:03,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 23:21:03,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:21:03,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 23:21:03,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 23:21:03,427 INFO L87 Difference]: Start difference. First operand 114 states and 154 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:21:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:21:03,537 INFO L93 Difference]: Finished difference Result 124 states and 163 transitions. [2023-11-24 23:21:03,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 23:21:03,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2023-11-24 23:21:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:21:03,539 INFO L225 Difference]: With dead ends: 124 [2023-11-24 23:21:03,539 INFO L226 Difference]: Without dead ends: 124 [2023-11-24 23:21:03,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-24 23:21:03,540 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 25 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-24 23:21:03,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 339 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-24 23:21:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-24 23:21:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 115. [2023-11-24 23:21:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.7887323943661972) internal successors, (127), 97 states have internal predecessors, (127), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2023-11-24 23:21:03,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 153 transitions. [2023-11-24 23:21:03,547 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 153 transitions. Word has length 24 [2023-11-24 23:21:03,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:21:03,547 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 153 transitions. [2023-11-24 23:21:03,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:21:03,548 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 153 transitions. [2023-11-24 23:21:03,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 23:21:03,549 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:21:03,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:21:03,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 23:21:03,550 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:21:03,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:21:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash -126915569, now seen corresponding path program 1 times [2023-11-24 23:21:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:21:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819354132] [2023-11-24 23:21:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:21:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 23:21:04,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:21:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819354132] [2023-11-24 23:21:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819354132] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:21:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855736684] [2023-11-24 23:21:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:04,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:21:04,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:21:04,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:21:04,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 23:21:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:04,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-24 23:21:04,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:21:04,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:21:04,243 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2023-11-24 23:21:04,261 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_21|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse0) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)) |v_old(#valid)_AFTER_CALL_21|))))) is different from false [2023-11-24 23:21:04,265 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_21|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse0) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)) |v_old(#valid)_AFTER_CALL_21|))))) is different from true [2023-11-24 23:21:04,286 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_21|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)) |v_old(#valid)_AFTER_CALL_21|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2023-11-24 23:21:04,288 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_21|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)) |v_old(#valid)_AFTER_CALL_21|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2023-11-24 23:21:04,381 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-24 23:21:04,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-24 23:21:04,399 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_42| |c_ULTIMATE.start_create_~now~1#1.base|)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_42| |v_old(#valid)_AFTER_CALL_21|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_42| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)) |v_old(#valid)_AFTER_CALL_21|)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) is different from false [2023-11-24 23:21:04,410 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_42| |c_ULTIMATE.start_create_~now~1#1.base|)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_42| |v_old(#valid)_AFTER_CALL_21|))) (and (= (select |c_#valid| .cse0) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_42| .cse0 (select |v_old(#valid)_AFTER_CALL_21| .cse0)) |v_old(#valid)_AFTER_CALL_21|)))))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) is different from true [2023-11-24 23:21:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-24 23:21:04,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:21:04,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855736684] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:21:04,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [376204141] [2023-11-24 23:21:04,677 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-24 23:21:04,677 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:21:04,677 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:21:04,677 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:21:04,678 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:21:05,737 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 52 for LOIs [2023-11-24 23:21:06,988 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 53 for LOIs [2023-11-24 23:21:07,017 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-24 23:21:07,030 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:21:10,971 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2626#(and (not (= (select |#valid| |ULTIMATE.start_create_~now~1#1.base|) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_#t~ret10#1.offset| 0) (or (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (exists ((|v_#valid_148| (Array Int Int))) (= (select |v_#valid_148| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((v_create_internal_~now~0.offset_21 Int) (|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#valid_149| (Array Int Int)) (v_create_internal_~now~0.base_23 Int) (|v_#length_120| (Array Int Int))) (and (= (store (store |v_#memory_$Pointer$.base_127| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21) (store (select |v_#memory_$Pointer$.base_127| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21)) 0 0)) v_create_internal_~now~0.base_23 (store (select (store |v_#memory_$Pointer$.base_127| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21) (store (select |v_#memory_$Pointer$.base_127| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21)) 0 0)) v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21 (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_127| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21) (store (select |v_#memory_$Pointer$.offset_127| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21)) 0 0)) v_create_internal_~now~0.base_23 (store (select (store |v_#memory_$Pointer$.offset_127| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21) (store (select |v_#memory_$Pointer$.offset_127| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21)) 0 0)) v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21 0))) (<= (+ v_create_internal_~now~0.offset_21 8) (select |#length| v_create_internal_~now~0.base_23)) (<= (+ (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21) 1) |#StackHeapBarrier|) (<= 0 v_create_internal_~now~0.offset_21) (= (store |v_#length_120| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21) 8) |#length|) (not (= (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21) 0)) (= (store |v_#valid_149| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21) 1) |#valid|) (= (select |v_#valid_149| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_23) v_create_internal_~now~0.offset_21)) 0) (= (select |#valid| v_create_internal_~now~0.base_23) 1))) (= |ULTIMATE.start_create_~now~1#1.base| |ULTIMATE.start_create_~sll~1#1.base|)) (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (exists ((|v_#length_120| (Array Int Int))) (= (store |v_#length_120| |ULTIMATE.start_create_#t~ret10#1.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.offset_127| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_127| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.offset_127| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)))) (not (= |ULTIMATE.start_create_#t~ret10#1.base| 0)) (exists ((|v_#valid_148| (Array Int Int))) (= (select |v_#valid_148| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (exists ((|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_127| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.base_127| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)) |#memory_$Pointer$.base|)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#valid_149| (Array Int Int))) (and (= (select |v_#valid_149| |ULTIMATE.start_create_#t~ret10#1.base|) 0) (= (store |v_#valid_149| |ULTIMATE.start_create_#t~ret10#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_create_#t~ret10#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_~now~1#1.base| |ULTIMATE.start_create_~sll~1#1.base|))) (= |ULTIMATE.start_create_~now~1#1.offset| 0) (= |ULTIMATE.start_create_~sll~1#1.offset| 0))' at error location [2023-11-24 23:21:10,971 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:21:10,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:21:10,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 17 [2023-11-24 23:21:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533349418] [2023-11-24 23:21:10,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:21:10,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-24 23:21:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:21:10,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-24 23:21:10,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1154, Unknown=7, NotChecked=292, Total=1640 [2023-11-24 23:21:10,974 INFO L87 Difference]: Start difference. First operand 115 states and 153 transitions. Second operand has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-24 23:21:11,609 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_21|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse1) (= (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_21| .cse1)) |v_old(#valid)_AFTER_CALL_21|))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2023-11-24 23:21:11,614 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_21|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= c_create_internal_~now~0.base .cse1) (= (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_21| .cse1)) |v_old(#valid)_AFTER_CALL_21|))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2023-11-24 23:21:11,622 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_21|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_21| .cse1)) |v_old(#valid)_AFTER_CALL_21|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2023-11-24 23:21:11,627 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_old(#valid)_AFTER_CALL_21|))) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_old(#valid)_AFTER_CALL_21| .cse1)) |v_old(#valid)_AFTER_CALL_21|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2023-11-24 23:21:11,642 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_42| |c_ULTIMATE.start_create_~now~1#1.base|)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_42| |v_old(#valid)_AFTER_CALL_21|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_42| .cse1 (select |v_old(#valid)_AFTER_CALL_21| .cse1)) |v_old(#valid)_AFTER_CALL_21|)))))) (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))))) is different from false [2023-11-24 23:21:11,645 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (exists ((|v_#valid_BEFORE_CALL_42| (Array Int Int))) (and (= 1 (select |v_#valid_BEFORE_CALL_42| |c_ULTIMATE.start_create_~now~1#1.base|)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_21| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_42| |v_old(#valid)_AFTER_CALL_21|))) (and (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_21| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_42| .cse1 (select |v_old(#valid)_AFTER_CALL_21| .cse1)) |v_old(#valid)_AFTER_CALL_21|)))))) (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))))) is different from true [2023-11-24 23:21:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:21:11,876 INFO L93 Difference]: Finished difference Result 130 states and 172 transitions. [2023-11-24 23:21:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 23:21:11,877 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 26 [2023-11-24 23:21:11,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:21:11,878 INFO L225 Difference]: With dead ends: 130 [2023-11-24 23:21:11,878 INFO L226 Difference]: Without dead ends: 130 [2023-11-24 23:21:11,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=268, Invalid=1553, Unknown=13, NotChecked=616, Total=2450 [2023-11-24 23:21:11,880 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 23 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 579 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 23:21:11,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 357 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 584 Invalid, 0 Unknown, 579 Unchecked, 0.6s Time] [2023-11-24 23:21:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-24 23:21:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2023-11-24 23:21:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.763157894736842) internal successors, (134), 102 states have internal predecessors, (134), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-24 23:21:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 164 transitions. [2023-11-24 23:21:11,887 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 164 transitions. Word has length 26 [2023-11-24 23:21:11,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:21:11,887 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 164 transitions. [2023-11-24 23:21:11,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 12 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-24 23:21:11,887 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2023-11-24 23:21:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-24 23:21:11,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:21:11,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:21:11,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-24 23:21:12,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:21:12,095 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:21:12,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:21:12,095 INFO L85 PathProgramCache]: Analyzing trace with hash -126915568, now seen corresponding path program 1 times [2023-11-24 23:21:12,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:21:12,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204514665] [2023-11-24 23:21:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:21:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:21:12,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:21:12,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204514665] [2023-11-24 23:21:12,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204514665] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:21:12,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281289155] [2023-11-24 23:21:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:12,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:21:12,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:21:12,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:21:12,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-24 23:21:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:12,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-24 23:21:12,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:21:12,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:21:13,105 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-24 23:21:13,132 WARN L876 $PredicateComparison]: unable to prove that (exists ((create_internal_~now~0.base Int) (alloc_and_zero_internal_~pi~1.base Int)) (and (= (store (store |c_old(#length)| create_internal_~now~0.base (select |c_#length| create_internal_~now~0.base)) alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| create_internal_~now~0.base) 0) (= (select (store |c_old(#valid)| create_internal_~now~0.base 1) alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-24 23:21:13,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:21:13,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:21:13,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:21:13,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2023-11-24 23:21:13,210 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-24 23:21:13,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-24 23:21:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-11-24 23:21:13,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:21:13,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281289155] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:21:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1175182529] [2023-11-24 23:21:13,512 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-24 23:21:13,512 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:21:13,512 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:21:13,512 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:21:13,513 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:21:14,419 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 50 for LOIs [2023-11-24 23:21:15,561 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 53 for LOIs [2023-11-24 23:21:15,603 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-24 23:21:15,614 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:21:19,649 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3024#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_#t~ret10#1.offset| 0) (<= (select |#length| |ULTIMATE.start_create_~now~1#1.base|) 15) (or (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (exists ((|v_#valid_175| (Array Int Int))) (= (select |v_#valid_175| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#valid_176| (Array Int Int)) (|v_#length_147| (Array Int Int)) (|v_#memory_$Pointer$.base_157| (Array Int (Array Int Int))) (v_create_internal_~now~0.base_35 Int) (v_create_internal_~now~0.offset_33 Int) (|v_#memory_$Pointer$.offset_157| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_157| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33) (store (select |v_#memory_$Pointer$.offset_157| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33)) 0 0)) v_create_internal_~now~0.base_35 (store (select (store |v_#memory_$Pointer$.offset_157| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33) (store (select |v_#memory_$Pointer$.offset_157| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33)) 0 0)) v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33 0))) (= |#valid| (store |v_#valid_176| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33) 1)) (= 1 (select |#valid| v_create_internal_~now~0.base_35)) (not (= (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33) 0)) (<= (+ (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33) 1) |#StackHeapBarrier|) (= (store |v_#length_147| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33) 8) |#length|) (<= (+ v_create_internal_~now~0.offset_33 8) (select |#length| v_create_internal_~now~0.base_35)) (<= 0 v_create_internal_~now~0.offset_33) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_157| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33) (store (select |v_#memory_$Pointer$.base_157| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33)) 0 0)) v_create_internal_~now~0.base_35 (store (select (store |v_#memory_$Pointer$.base_157| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33) (store (select |v_#memory_$Pointer$.base_157| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33)) 0 0)) v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33 (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33)))) (= (select |v_#valid_176| (select (select |#memory_$Pointer$.base| v_create_internal_~now~0.base_35) v_create_internal_~now~0.offset_33)) 0))) (= |ULTIMATE.start_create_~now~1#1.base| |ULTIMATE.start_create_~sll~1#1.base|)) (and (<= (+ |ULTIMATE.start_create_~sll~1#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_create_~sll~1#1.base| 0)) (exists ((|v_#valid_176| (Array Int Int))) (and (= (select |v_#valid_176| |ULTIMATE.start_create_#t~ret10#1.base|) 0) (= (store |v_#valid_176| |ULTIMATE.start_create_#t~ret10#1.base| 1) |#valid|))) (not (= |ULTIMATE.start_create_#t~ret10#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_157| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_157| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.base_157| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)) |#memory_$Pointer$.base|)) (exists ((|v_#valid_175| (Array Int Int))) (= (select |v_#valid_175| |ULTIMATE.start_create_~sll~1#1.base|) 0)) (exists ((|v_#length_147| (Array Int Int))) (= |#length| (store |v_#length_147| |ULTIMATE.start_create_#t~ret10#1.base| 8))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (<= (+ |ULTIMATE.start_create_#t~ret10#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_157| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_157| |ULTIMATE.start_create_#t~ret10#1.base| (store (select |v_#memory_$Pointer$.offset_157| |ULTIMATE.start_create_#t~ret10#1.base|) 0 0)))) (= |ULTIMATE.start_create_~now~1#1.base| |ULTIMATE.start_create_~sll~1#1.base|))) (= |ULTIMATE.start_create_~now~1#1.offset| 0) (= |ULTIMATE.start_create_~sll~1#1.offset| 0))' at error location [2023-11-24 23:21:19,649 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:21:19,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:21:19,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-11-24 23:21:19,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618741714] [2023-11-24 23:21:19,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:21:19,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-24 23:21:19,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:21:19,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-24 23:21:19,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1784, Unknown=2, NotChecked=174, Total=2162 [2023-11-24 23:21:19,652 INFO L87 Difference]: Start difference. First operand 121 states and 164 transitions. Second operand has 25 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-24 23:21:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:21:20,546 INFO L93 Difference]: Finished difference Result 138 states and 186 transitions. [2023-11-24 23:21:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 23:21:20,549 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 26 [2023-11-24 23:21:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:21:20,550 INFO L225 Difference]: With dead ends: 138 [2023-11-24 23:21:20,551 INFO L226 Difference]: Without dead ends: 138 [2023-11-24 23:21:20,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=244, Invalid=2114, Unknown=2, NotChecked=190, Total=2550 [2023-11-24 23:21:20,553 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 49 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-24 23:21:20,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 322 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 633 Invalid, 0 Unknown, 242 Unchecked, 0.6s Time] [2023-11-24 23:21:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-24 23:21:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2023-11-24 23:21:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 103 states have internal predecessors, (137), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-24 23:21:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2023-11-24 23:21:20,560 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 167 transitions. Word has length 26 [2023-11-24 23:21:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:21:20,561 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 167 transitions. [2023-11-24 23:21:20,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 19 states have internal predecessors, (35), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-24 23:21:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 167 transitions. [2023-11-24 23:21:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-24 23:21:20,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:21:20,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:21:20,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-24 23:21:20,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:21:20,768 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:21:20,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:21:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash 516984702, now seen corresponding path program 1 times [2023-11-24 23:21:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:21:20,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015459459] [2023-11-24 23:21:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:21:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21: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-24 23:21:21,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:21:21,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015459459] [2023-11-24 23:21:21,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015459459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:21:21,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:21:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-24 23:21:21,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597331717] [2023-11-24 23:21:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:21:21,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 23:21:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:21:21,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 23:21:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-11-24 23:21:21,261 INFO L87 Difference]: Start difference. First operand 122 states and 167 transitions. Second operand has 14 states, 9 states have (on average 2.111111111111111) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:21:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:21:21,661 INFO L93 Difference]: Finished difference Result 143 states and 186 transitions. [2023-11-24 23:21:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 23:21:21,661 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 9 states have (on average 2.111111111111111) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-11-24 23:21:21,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:21:21,663 INFO L225 Difference]: With dead ends: 143 [2023-11-24 23:21:21,663 INFO L226 Difference]: Without dead ends: 143 [2023-11-24 23:21:21,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2023-11-24 23:21:21,664 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 34 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:21:21,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 471 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-24 23:21:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-24 23:21:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 130. [2023-11-24 23:21:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.7411764705882353) internal successors, (148), 110 states have internal predecessors, (148), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-24 23:21:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2023-11-24 23:21:21,671 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 25 [2023-11-24 23:21:21,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:21:21,671 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2023-11-24 23:21:21,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 9 states have (on average 2.111111111111111) internal successors, (19), 11 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:21:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2023-11-24 23:21:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-24 23:21:21,673 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:21:21,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:21:21,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 23:21:21,673 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:21:21,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:21:21,674 INFO L85 PathProgramCache]: Analyzing trace with hash 516984703, now seen corresponding path program 1 times [2023-11-24 23:21:21,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:21:21,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445609029] [2023-11-24 23:21:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:21,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:21:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:22,221 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-24 23:21:22,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:21:22,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445609029] [2023-11-24 23:21:22,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445609029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 23:21:22,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 23:21:22,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-24 23:21:22,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970736037] [2023-11-24 23:21:22,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 23:21:22,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-24 23:21:22,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:21:22,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-24 23:21:22,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2023-11-24 23:21:22,224 INFO L87 Difference]: Start difference. First operand 130 states and 178 transitions. Second operand has 15 states, 10 states have (on average 1.9) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:21:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:21:22,705 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2023-11-24 23:21:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 23:21:22,706 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-11-24 23:21:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:21:22,707 INFO L225 Difference]: With dead ends: 142 [2023-11-24 23:21:22,707 INFO L226 Difference]: Without dead ends: 142 [2023-11-24 23:21:22,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2023-11-24 23:21:22,708 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 33 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-24 23:21:22,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 528 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-24 23:21:22,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-24 23:21:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2023-11-24 23:21:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.7294117647058824) internal successors, (147), 110 states have internal predecessors, (147), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-24 23:21:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2023-11-24 23:21:22,715 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 25 [2023-11-24 23:21:22,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:21:22,715 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2023-11-24 23:21:22,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-24 23:21:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2023-11-24 23:21:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 23:21:22,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:21:22,717 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:21:22,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-24 23:21:22,717 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:21:22,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:21:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1667922174, now seen corresponding path program 1 times [2023-11-24 23:21:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:21:22,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717950602] [2023-11-24 23:21:22,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:22,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:21:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:21:22,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:21:22,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717950602] [2023-11-24 23:21:22,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717950602] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:21:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406453344] [2023-11-24 23:21:22,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:22,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:21:22,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:21:22,959 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:21:22,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-24 23:21:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:23,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-24 23:21:23,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:21:23,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:21:23,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 23:21:23,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 23:21:23,139 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-24 23:21:23,161 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-24 23:21:23,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-24 23:21:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-24 23:21:23,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:21:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406453344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:21:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1900682018] [2023-11-24 23:21:23,218 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-24 23:21:23,219 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:21:23,219 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:21:23,219 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:21:23,220 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:21:23,272 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 52 for LOIs [2023-11-24 23:21:24,300 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero_internal with input of size 53 for LOIs [2023-11-24 23:21:24,328 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 19 for LOIs [2023-11-24 23:21:24,340 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-24 23:21:26,906 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4004#(and (= create_internal_~sll~0.offset 0) (<= 1 |#StackHeapBarrier|) (not (= (select |#valid| create_internal_~now~0.base) 1)) (not (= |create_internal_#t~ret7.base| 0)) (exists ((|v_#memory_$Pointer$.offset_179| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_179| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.offset_179| |create_internal_#t~ret7.base|) 0 0)))) (= |create_internal_#t~ret7.offset| 0) (<= (+ |create_internal_#t~ret7.base| 1) |#StackHeapBarrier|) (exists ((|v_#valid_192| (Array Int Int))) (and (= |#valid| (store |v_#valid_192| |create_internal_#t~ret7.base| 1)) (= (select |v_#valid_192| |create_internal_#t~ret7.base|) 0))) (exists ((|v_#length_159| (Array Int Int))) (= (store |v_#length_159| |create_internal_#t~ret7.base| 8) |#length|)) (exists ((|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_180| |create_internal_#t~ret7.base| (store (select |v_#memory_$Pointer$.base_180| |create_internal_#t~ret7.base|) 0 0)) |#memory_$Pointer$.base|)))' at error location [2023-11-24 23:21:26,906 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-24 23:21:26,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 23:21:26,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2023-11-24 23:21:26,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85107348] [2023-11-24 23:21:26,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 23:21:26,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 23:21:26,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-24 23:21:26,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 23:21:26,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=718, Unknown=1, NotChecked=54, Total=870 [2023-11-24 23:21:26,909 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand has 11 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-24 23:21:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-24 23:21:27,348 INFO L93 Difference]: Finished difference Result 129 states and 176 transitions. [2023-11-24 23:21:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 23:21:27,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 28 [2023-11-24 23:21:27,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-24 23:21:27,352 INFO L225 Difference]: With dead ends: 129 [2023-11-24 23:21:27,352 INFO L226 Difference]: Without dead ends: 129 [2023-11-24 23:21:27,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=123, Invalid=936, Unknown=1, NotChecked=62, Total=1122 [2023-11-24 23:21:27,353 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 13 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-24 23:21:27,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 311 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 383 Invalid, 0 Unknown, 90 Unchecked, 0.3s Time] [2023-11-24 23:21:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-24 23:21:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-11-24 23:21:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 85 states have (on average 1.7176470588235293) internal successors, (146), 109 states have internal predecessors, (146), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2023-11-24 23:21:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 176 transitions. [2023-11-24 23:21:27,369 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 176 transitions. Word has length 28 [2023-11-24 23:21:27,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-24 23:21:27,369 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 176 transitions. [2023-11-24 23:21:27,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-24 23:21:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 176 transitions. [2023-11-24 23:21:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-24 23:21:27,370 INFO L187 NwaCegarLoop]: Found error trace [2023-11-24 23:21:27,370 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 23:21:27,382 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-24 23:21:27,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-24 23:21:27,571 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2023-11-24 23:21:27,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 23:21:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1667922173, now seen corresponding path program 1 times [2023-11-24 23:21:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-24 23:21:27,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242784521] [2023-11-24 23:21:27,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:27,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 23:21:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 23:21:27,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-24 23:21:27,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242784521] [2023-11-24 23:21:27,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242784521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:21:27,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292489535] [2023-11-24 23:21:27,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 23:21:27,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 23:21:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-24 23:21:27,951 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 23:21:27,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8c7a7408-d001-4d22-8963-c36536ee23e2/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-24 23:21:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 23:21:28,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-24 23:21:28,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 23:21:28,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-24 23:21:28,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 23:21:28,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 23:21:28,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 23:21:28,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-24 23:21:28,316 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2023-11-24 23:21:28,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 23:21:28,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-24 23:21:28,342 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 23:21:28,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-24 23:21:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-24 23:21:28,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 23:21:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292489535] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 23:21:28,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1314694661] [2023-11-24 23:21:28,509 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2023-11-24 23:21:28,510 INFO L166 IcfgInterpreter]: Building call graph [2023-11-24 23:21:28,510 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-24 23:21:28,510 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-24 23:21:28,511 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-24 23:21:28,586 INFO L197 IcfgInterpreter]: Interpreting procedure create_internal with input of size 52 for LOIs