./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/sll-shared-before.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/sll-shared-before.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:33:10,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:33:10,723 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-12-02 17:33:10,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:33:10,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:33:10,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:33:10,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:33:10,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:33:10,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:33:10,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:33:10,760 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:33:10,761 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:33:10,762 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:33:10,762 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:33:10,763 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:33:10,764 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:33:10,764 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:33:10,765 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:33:10,766 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:33:10,766 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:33:10,767 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:33:10,768 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:33:10,769 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 17:33:10,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 17:33:10,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:33:10,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:33:10,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:33:10,771 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 17:33:10,772 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 17:33:10,772 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 17:33:10,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:33:10,773 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:33:10,774 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 17:33:10,774 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:33:10,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:33:10,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:33:10,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:33:10,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:33:10,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:33:10,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:33:10,776 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:33:10,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:33:10,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:33:10,776 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:33:10,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:33:10,777 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_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f [2023-12-02 17:33:11,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:33:11,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:33:11,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:33:11,106 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:33:11,106 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:33:11,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2023-12-02 17:33:14,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:33:14,812 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:33:14,812 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2023-12-02 17:33:14,845 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/data/69fc97aea/f84162f532674259a3704dc9147486da/FLAG2e003fdd0 [2023-12-02 17:33:14,859 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/data/69fc97aea/f84162f532674259a3704dc9147486da [2023-12-02 17:33:14,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:33:14,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:33:14,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:33:14,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:33:14,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:33:14,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:33:14" (1/1) ... [2023-12-02 17:33:14,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f8bda41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:14, skipping insertion in model container [2023-12-02 17:33:14,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:33:14" (1/1) ... [2023-12-02 17:33:14,953 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:33:15,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:33:15,241 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:33:15,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:33:15,314 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:33:15,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15 WrapperNode [2023-12-02 17:33:15,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:33:15,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:33:15,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:33:15,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:33:15,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,364 INFO L138 Inliner]: procedures = 120, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2023-12-02 17:33:15,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:33:15,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:33:15,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:33:15,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:33:15,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:33:15,400 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:33:15,400 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:33:15,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:33:15,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (1/1) ... [2023-12-02 17:33:15,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:33:15,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:15,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:33:15,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:33:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 17:33:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2023-12-02 17:33:15,470 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2023-12-02 17:33:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:33:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 17:33:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 17:33:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:33:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:33:15,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:33:15,585 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:33:15,588 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:33:15,837 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:33:15,893 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:33:15,893 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-02 17:33:15,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:33:15 BoogieIcfgContainer [2023-12-02 17:33:15,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:33:15,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:33:15,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:33:15,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:33:15,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:33:14" (1/3) ... [2023-12-02 17:33:15,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b648ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:33:15, skipping insertion in model container [2023-12-02 17:33:15,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:33:15" (2/3) ... [2023-12-02 17:33:15,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b648ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:33:15, skipping insertion in model container [2023-12-02 17:33:15,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:33:15" (3/3) ... [2023-12-02 17:33:15,906 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-before.i [2023-12-02 17:33:15,927 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:33:15,928 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2023-12-02 17:33:15,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:33:15,985 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;@56027705, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:33:15,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-12-02 17:33:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:33:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 17:33:15,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:15,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 17:33:15,997 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:16,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:16,003 INFO L85 PathProgramCache]: Analyzing trace with hash 3792, now seen corresponding path program 1 times [2023-12-02 17:33:16,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:16,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443913429] [2023-12-02 17:33:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:16,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:16,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:16,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443913429] [2023-12-02 17:33:16,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443913429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:33:16,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:33:16,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 17:33:16,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082090152] [2023-12-02 17:33:16,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:33:16,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:33:16,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:16,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:33:16,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:16,246 INFO L87 Difference]: Start difference. First operand has 49 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 45 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:16,369 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2023-12-02 17:33:16,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:33:16,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 17:33:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:16,381 INFO L225 Difference]: With dead ends: 48 [2023-12-02 17:33:16,382 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 17:33:16,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:16,389 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:16,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:33:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 17:33:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-02 17:33:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 43 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:33:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2023-12-02 17:33:16,436 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 2 [2023-12-02 17:33:16,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:16,436 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2023-12-02 17:33:16,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2023-12-02 17:33:16,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 17:33:16,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:16,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 17:33:16,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:33:16,438 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:16,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:16,439 INFO L85 PathProgramCache]: Analyzing trace with hash 3793, now seen corresponding path program 1 times [2023-12-02 17:33:16,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:16,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689661937] [2023-12-02 17:33:16,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:16,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:16,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689661937] [2023-12-02 17:33:16,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689661937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:33:16,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:33:16,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 17:33:16,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516211517] [2023-12-02 17:33:16,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:33:16,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:33:16,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:16,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:33:16,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:16,546 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:16,616 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2023-12-02 17:33:16,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:33:16,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 17:33:16,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:16,618 INFO L225 Difference]: With dead ends: 46 [2023-12-02 17:33:16,618 INFO L226 Difference]: Without dead ends: 46 [2023-12-02 17:33:16,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:16,621 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:16,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:33:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-02 17:33:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-02 17:33:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 22 states have (on average 2.0) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:33:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2023-12-02 17:33:16,630 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 2 [2023-12-02 17:33:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:16,630 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2023-12-02 17:33:16,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2023-12-02 17:33:16,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 17:33:16,631 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:16,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 17:33:16,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 17:33:16,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:16,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:16,633 INFO L85 PathProgramCache]: Analyzing trace with hash 115549681, now seen corresponding path program 1 times [2023-12-02 17:33:16,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:16,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132070384] [2023-12-02 17:33:16,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:16,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:16,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:16,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132070384] [2023-12-02 17:33:16,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132070384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:33:16,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:33:16,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:33:16,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673576350] [2023-12-02 17:33:16,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:33:16,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:33:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:33:16,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:16,736 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:16,795 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2023-12-02 17:33:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:33:16,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 17:33:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:16,797 INFO L225 Difference]: With dead ends: 45 [2023-12-02 17:33:16,797 INFO L226 Difference]: Without dead ends: 45 [2023-12-02 17:33:16,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:16,799 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:16,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:33:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-02 17:33:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-02 17:33:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 41 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:33:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2023-12-02 17:33:16,807 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 5 [2023-12-02 17:33:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:16,808 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2023-12-02 17:33:16,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2023-12-02 17:33:16,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 17:33:16,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:16,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 17:33:16,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 17:33:16,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:16,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:16,811 INFO L85 PathProgramCache]: Analyzing trace with hash 115549682, now seen corresponding path program 1 times [2023-12-02 17:33:16,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:16,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261043410] [2023-12-02 17:33:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:16,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:16,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:16,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261043410] [2023-12-02 17:33:16,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261043410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:33:16,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:33:16,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:33:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875881976] [2023-12-02 17:33:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:33:16,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:33:16,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:16,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:33:16,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:16,929 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:16,979 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2023-12-02 17:33:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:33:16,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 17:33:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:16,980 INFO L225 Difference]: With dead ends: 44 [2023-12-02 17:33:16,981 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 17:33:16,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:16,983 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:16,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 63 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 17:33:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 17:33:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-02 17:33:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 40 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:33:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2023-12-02 17:33:16,991 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 5 [2023-12-02 17:33:16,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:16,991 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2023-12-02 17:33:16,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2023-12-02 17:33:16,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 17:33:16,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:16,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:16,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 17:33:16,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:16,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:16,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2074385775, now seen corresponding path program 1 times [2023-12-02 17:33:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406801401] [2023-12-02 17:33:16,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:16,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:17,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:17,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406801401] [2023-12-02 17:33:17,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406801401] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:33:17,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:33:17,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:33:17,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254005298] [2023-12-02 17:33:17,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:33:17,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:33:17,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:17,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:33:17,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:33:17,119 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:33:17,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:17,221 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2023-12-02 17:33:17,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:33:17,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-12-02 17:33:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:17,224 INFO L225 Difference]: With dead ends: 45 [2023-12-02 17:33:17,225 INFO L226 Difference]: Without dead ends: 45 [2023-12-02 17:33:17,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:33:17,227 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:17,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 73 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:33:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-02 17:33:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2023-12-02 17:33:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:33:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2023-12-02 17:33:17,236 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 8 [2023-12-02 17:33:17,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:17,237 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2023-12-02 17:33:17,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:33:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2023-12-02 17:33:17,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 17:33:17,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:17,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:17,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 17:33:17,239 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:17,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2074385776, now seen corresponding path program 1 times [2023-12-02 17:33:17,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:17,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390838622] [2023-12-02 17:33:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:17,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:17,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:17,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390838622] [2023-12-02 17:33:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390838622] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:33:17,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:33:17,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:33:17,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085383932] [2023-12-02 17:33:17,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:33:17,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:33:17,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:17,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:33:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:33:17,449 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:33:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:17,563 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2023-12-02 17:33:17,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:33:17,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2023-12-02 17:33:17,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:17,566 INFO L225 Difference]: With dead ends: 44 [2023-12-02 17:33:17,567 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 17:33:17,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:33:17,568 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:17,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 114 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:33:17,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 17:33:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2023-12-02 17:33:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 36 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:33:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2023-12-02 17:33:17,576 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 8 [2023-12-02 17:33:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:17,576 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2023-12-02 17:33:17,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:33:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2023-12-02 17:33:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 17:33:17,577 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:17,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:17,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 17:33:17,578 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:17,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:17,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1272537238, now seen corresponding path program 1 times [2023-12-02 17:33:17,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:17,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564559899] [2023-12-02 17:33:17,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:17,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:17,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564559899] [2023-12-02 17:33:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564559899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:33:17,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:33:17,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:33:17,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493118093] [2023-12-02 17:33:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:33:17,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:33:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:17,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:33:17,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:17,622 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:33:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:17,643 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-12-02 17:33:17,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:33:17,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-12-02 17:33:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:17,645 INFO L225 Difference]: With dead ends: 39 [2023-12-02 17:33:17,645 INFO L226 Difference]: Without dead ends: 39 [2023-12-02 17:33:17,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:17,646 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:17,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 17:33:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-02 17:33:17,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-02 17:33:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 35 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:33:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2023-12-02 17:33:17,652 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 12 [2023-12-02 17:33:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:17,653 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2023-12-02 17:33:17,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:33:17,653 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2023-12-02 17:33:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 17:33:17,654 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:17,654 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:17,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 17:33:17,655 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:17,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash -793948631, now seen corresponding path program 1 times [2023-12-02 17:33:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:17,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240460047] [2023-12-02 17:33:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:17,701 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:17,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240460047] [2023-12-02 17:33:17,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240460047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:33:17,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:33:17,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:33:17,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899180074] [2023-12-02 17:33:17,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:33:17,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:33:17,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:33:17,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:17,704 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:33:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:17,735 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2023-12-02 17:33:17,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:33:17,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-02 17:33:17,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:17,736 INFO L225 Difference]: With dead ends: 38 [2023-12-02 17:33:17,737 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 17:33:17,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:33:17,738 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:17,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 17:33:17,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 17:33:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-12-02 17:33:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:33:17,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2023-12-02 17:33:17,743 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 13 [2023-12-02 17:33:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:17,744 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2023-12-02 17:33:17,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:33:17,744 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2023-12-02 17:33:17,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 17:33:17,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:17,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:17,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 17:33:17,745 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:17,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:17,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1157396300, now seen corresponding path program 1 times [2023-12-02 17:33:17,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:17,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497783009] [2023-12-02 17:33:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:17,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:17,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497783009] [2023-12-02 17:33:17,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497783009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:33:17,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:33:17,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 17:33:17,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103220134] [2023-12-02 17:33:17,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:33:17,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:33:17,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:17,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:33:17,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:33:17,901 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:33:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:18,039 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2023-12-02 17:33:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:33:18,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-02 17:33:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:18,042 INFO L225 Difference]: With dead ends: 37 [2023-12-02 17:33:18,042 INFO L226 Difference]: Without dead ends: 37 [2023-12-02 17:33:18,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:33:18,044 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:18,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 72 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:33:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-02 17:33:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-02 17:33:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 33 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:33:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2023-12-02 17:33:18,050 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 14 [2023-12-02 17:33:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:18,050 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2023-12-02 17:33:18,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:33:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2023-12-02 17:33:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 17:33:18,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:18,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:18,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 17:33:18,052 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:18,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1571626466, now seen corresponding path program 1 times [2023-12-02 17:33:18,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:18,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198640427] [2023-12-02 17:33:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:18,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:18,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:18,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198640427] [2023-12-02 17:33:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198640427] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:18,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070814453] [2023-12-02 17:33:18,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:18,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:18,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:18,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:18,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:33:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:18,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 17:33:18,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:18,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:33:18,584 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2023-12-02 17:33:18,629 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-12-02 17:33:18,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-12-02 17:33:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 17:33:18,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:18,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070814453] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:18,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [226617052] [2023-12-02 17:33:18,735 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 17:33:18,735 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:33:18,741 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:33:18,748 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:33:18,748 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:33:20,897 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 211 for LOIs [2023-12-02 17:33:21,133 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:33:56,457 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '913#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_#in~data#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_create_~now~0#1.offset| 0) (= |ULTIMATE.start_create_#t~ret6#1.offset| 0) (= |ULTIMATE.start_create_~data#1.offset| 0) (= |ULTIMATE.start_create_~sll~0#1.offset| 0) (or (and (exists ((|v_#length_48| (Array Int Int))) (= (store |v_#length_48| |ULTIMATE.start_create_#t~ret6#1.base| 16) |#length|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_40| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_#t~ret6#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret6#1.base|) 8))))) (= |ULTIMATE.start_create_~sll~0#1.base| |ULTIMATE.start_create_~now~0#1.base|) (exists ((|v_#memory_int_41| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_5| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_5| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_5| (Array Int Int)) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (and (or (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)) (= (store |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_int)_AFTER_CALL_3|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_#length_48| (Array Int Int))) (= (store |v_#length_48| |ULTIMATE.start_create_~sll~0#1.base| 16) |v_old(#length)_AFTER_CALL_5|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.offset_48|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_3| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_3| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#valid_63| (Array Int Int))) (and (= (select |v_#valid_63| |ULTIMATE.start_create_~sll~0#1.base|) 0) (= (store |v_#valid_63| |ULTIMATE.start_create_~sll~0#1.base| 1) |v_old(#valid)_AFTER_CALL_5|))) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |v_#memory_int_41| (store |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~sll~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_48|))) (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_#length_48| (Array Int Int))) (= (store |v_#length_48| |ULTIMATE.start_create_~sll~0#1.base| 16) |v_old(#length)_AFTER_CALL_5|)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_4| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_4| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_4| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.offset_48|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_4| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)) (= (store |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_4| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_int)_AFTER_CALL_4|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_4| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647))) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_4| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_4| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_4| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#valid_63| (Array Int Int))) (and (= (select |v_#valid_63| |ULTIMATE.start_create_~sll~0#1.base|) 0) (= (store |v_#valid_63| |ULTIMATE.start_create_~sll~0#1.base| 1) |v_old(#valid)_AFTER_CALL_5|))) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |v_#memory_int_41| (store |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~sll~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_48|)))) (= |v_old(#memory_int)_AFTER_CALL_5| (store |v_#memory_int_41| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_41| |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_5| |ULTIMATE.start_create_~now~0#1.base|) 0)))))) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)) |#memory_$Pointer$.base|)) (exists ((|v_#valid_63| (Array Int Int))) (and (= 0 (select |v_#valid_63| |ULTIMATE.start_create_#t~ret6#1.base|)) (= (store |v_#valid_63| |ULTIMATE.start_create_#t~ret6#1.base| 1) |#valid|))) (not (= |ULTIMATE.start_create_#t~ret6#1.base| 0)) (<= (+ |ULTIMATE.start_create_#t~ret6#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)))) (exists ((|v_ULTIMATE.start_create_#t~nondet5#1_12| Int)) (and (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet5#1_12| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet5#1_12| 0)) (<= |v_ULTIMATE.start_create_#t~nondet5#1_12| 2147483647)))) (and (exists ((|v_#length_48| (Array Int Int))) (= (store |v_#length_48| |ULTIMATE.start_create_#t~ret6#1.base| 16) |#length|)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_40| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_#t~ret6#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret6#1.base|) 8))))) (= |ULTIMATE.start_create_~sll~0#1.base| |ULTIMATE.start_create_~now~0#1.base|) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)) |#memory_$Pointer$.base|)) (exists ((|v_#valid_63| (Array Int Int))) (and (= 0 (select |v_#valid_63| |ULTIMATE.start_create_#t~ret6#1.base|)) (= (store |v_#valid_63| |ULTIMATE.start_create_#t~ret6#1.base| 1) |#valid|))) (not (= |ULTIMATE.start_create_#t~ret6#1.base| 0)) (<= (+ |ULTIMATE.start_create_#t~ret6#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)))) (exists ((|v_ULTIMATE.start_create_#t~nondet5#1_12| Int)) (and (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet5#1_12| 2147483648)) (not (= |v_ULTIMATE.start_create_#t~nondet5#1_12| 0)) (<= |v_ULTIMATE.start_create_#t~nondet5#1_12| 2147483647))) (exists ((|v_#memory_int_41| (Array Int (Array Int Int))) (|v_old(#length)_AFTER_CALL_6| (Array Int Int)) (|v_#memory_$Pointer$.offset_48| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_6| (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_6| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_48| (Array Int (Array Int Int)))) (and (or (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_4| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_4| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_4| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.offset_48|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (exists ((|v_#length_48| (Array Int Int))) (= (store |v_#length_48| |ULTIMATE.start_create_~sll~0#1.base| 16) |v_old(#length)_AFTER_CALL_6|)) (exists ((|v_#valid_63| (Array Int Int))) (and (= (select |v_#valid_63| |ULTIMATE.start_create_~sll~0#1.base|) 0) (= (store |v_#valid_63| |ULTIMATE.start_create_~sll~0#1.base| 1) |v_old(#valid)_AFTER_CALL_6|))) (exists ((|v_old(#memory_int)_AFTER_CALL_4| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_4| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)) (= (store |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_4| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_int)_AFTER_CALL_4|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_4| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647))) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_4| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_4| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_4| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |v_#memory_int_41| (store |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~sll~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_48|))) (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_old(#memory_int)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_int_39| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)) (= (store |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_39| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_int)_AFTER_CALL_3|) (<= (select (select |v_old(#memory_int)_AFTER_CALL_3| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_46| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| (store |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_3| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.offset_48|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (exists ((|v_#length_48| (Array Int Int))) (= (store |v_#length_48| |ULTIMATE.start_create_~sll~0#1.base| 16) |v_old(#length)_AFTER_CALL_6|)) (exists ((|v_#valid_63| (Array Int Int))) (and (= (select |v_#valid_63| |ULTIMATE.start_create_~sll~0#1.base|) 0) (= (store |v_#valid_63| |ULTIMATE.start_create_~sll~0#1.base| 1) |v_old(#valid)_AFTER_CALL_6|))) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_46| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_3| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_3| (store |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_46| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_3| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#memory_int_40| (Array Int (Array Int Int)))) (= |v_#memory_int_41| (store |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_40| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_41| |ULTIMATE.start_create_~sll~0#1.base|) 8))))) (exists ((|v_#memory_$Pointer$.base_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_47| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_48|)))) (= (store |v_#memory_int_41| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_41| |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_6| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_old(#memory_int)_AFTER_CALL_6|))))) (not (= (select |#valid| |ULTIMATE.start_create_~now~0#1.base|) 1)))' at error location [2023-12-02 17:33:56,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:33:56,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:33:56,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2023-12-02 17:33:56,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2482519] [2023-12-02 17:33:56,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:56,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 17:33:56,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:56,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 17:33:56,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=389, Unknown=9, NotChecked=40, Total=506 [2023-12-02 17:33:56,460 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 17:33:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:56,719 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2023-12-02 17:33:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:33:56,719 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 15 [2023-12-02 17:33:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:56,720 INFO L225 Difference]: With dead ends: 43 [2023-12-02 17:33:56,720 INFO L226 Difference]: Without dead ends: 43 [2023-12-02 17:33:56,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=83, Invalid=464, Unknown=9, NotChecked=44, Total=600 [2023-12-02 17:33:56,721 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:56,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 96 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 158 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2023-12-02 17:33:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-02 17:33:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2023-12-02 17:33:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.6) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:33:56,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-12-02 17:33:56,728 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2023-12-02 17:33:56,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:56,728 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-12-02 17:33:56,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 17:33:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-12-02 17:33:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 17:33:56,729 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:56,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:56,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:33:56,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 17:33:56,930 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:33:56,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1571626467, now seen corresponding path program 1 times [2023-12-02 17:33:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:56,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956330123] [2023-12-02 17:33:56,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:56,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:57,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:57,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956330123] [2023-12-02 17:33:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956330123] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:57,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061076331] [2023-12-02 17:33:57,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:57,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:57,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:57,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:57,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 17:33:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:57,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 17:33:57,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:57,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:33:57,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:33:57,533 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2023-12-02 17:33:57,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:33:57,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 17:33:57,559 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:33:57,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 17:33:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 17:33:57,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:57,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061076331] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:57,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2130749267] [2023-12-02 17:33:57,711 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-12-02 17:33:57,711 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:33:57,712 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:33:57,712 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:33:57,712 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:33:58,698 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 207 for LOIs [2023-12-02 17:33:58,895 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:34:33,142 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1080#(and (<= 1 |#StackHeapBarrier|) (<= (select |#length| |ULTIMATE.start_create_~now~0#1.base|) 15) (= |ULTIMATE.start_create_#in~data#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_create_~now~0#1.offset| 0) (= |ULTIMATE.start_create_#t~ret6#1.offset| 0) (= |ULTIMATE.start_create_~data#1.offset| 0) (= |ULTIMATE.start_create_~sll~0#1.offset| 0) (or (and (exists ((|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)))) (= |ULTIMATE.start_create_~sll~0#1.base| |ULTIMATE.start_create_~now~0#1.base|) (not (= |ULTIMATE.start_create_#t~ret6#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)) |#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_create_#t~nondet5#1_13| Int)) (and (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet5#1_13| 2147483648)) (<= |v_ULTIMATE.start_create_#t~nondet5#1_13| 2147483647) (not (= |v_ULTIMATE.start_create_#t~nondet5#1_13| 0)))) (exists ((|v_#valid_73| (Array Int Int))) (and (= (select |v_#valid_73| |ULTIMATE.start_create_#t~ret6#1.base|) 0) (= (store |v_#valid_73| |ULTIMATE.start_create_#t~ret6#1.base| 1) |#valid|))) (<= (+ |ULTIMATE.start_create_#t~ret6#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_48| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_48| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_int_48| |ULTIMATE.start_create_#t~ret6#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret6#1.base|) 8))))) (exists ((|v_old(#length)_AFTER_CALL_12| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_12| (Array Int Int)) (|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int))) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_12| (Array Int (Array Int Int)))) (and (or (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| (store |v_#memory_$Pointer$.offset_54| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_54| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)) (<= (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_47| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_main_~data~0#1.base|) 0)))))) (exists ((|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_56|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (exists ((|v_#length_59| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_12| (store |v_#length_59| |ULTIMATE.start_create_~sll~0#1.base| 16))) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_54| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_54| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_56| (store |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)))) (exists ((|v_#valid_73| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_73| |ULTIMATE.start_create_~sll~0#1.base| 1)) (= (select |v_#valid_73| |ULTIMATE.start_create_~sll~0#1.base|) 0))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_int_48| (Array Int (Array Int Int)))) (= (store |v_#memory_int_48| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_48| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_49| |ULTIMATE.start_create_~sll~0#1.base|) 8))) |v_#memory_int_49|)) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0))) (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_56|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (exists ((|v_#length_59| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_12| (store |v_#length_59| |ULTIMATE.start_create_~sll~0#1.base| 16))) (exists ((|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_54| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_54| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9|)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_56| (store |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)))) (exists ((|v_#valid_73| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_12| (store |v_#valid_73| |ULTIMATE.start_create_~sll~0#1.base| 1)) (= (select |v_#valid_73| |ULTIMATE.start_create_~sll~0#1.base|) 0))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_int_48| (Array Int (Array Int Int)))) (= (store |v_#memory_int_48| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_48| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_49| |ULTIMATE.start_create_~sll~0#1.base|) 8))) |v_#memory_int_49|)) (exists ((|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_54| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_54| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_9| (store |v_#memory_int_47| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_main_~data~0#1.base|) 0)))) (<= (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)))))) (= |v_old(#memory_int)_AFTER_CALL_12| (store |v_#memory_int_49| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_12| |ULTIMATE.start_create_~now~0#1.base|) 0)))))) (exists ((|v_#length_59| (Array Int Int))) (= (store |v_#length_59| |ULTIMATE.start_create_#t~ret6#1.base| 16) |#length|))) (and (exists ((|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)))) (= |ULTIMATE.start_create_~sll~0#1.base| |ULTIMATE.start_create_~now~0#1.base|) (not (= |ULTIMATE.start_create_#t~ret6#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_#t~ret6#1.base|) 8 0)) |#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_create_#t~nondet5#1_13| Int)) (and (<= 0 (+ |v_ULTIMATE.start_create_#t~nondet5#1_13| 2147483648)) (<= |v_ULTIMATE.start_create_#t~nondet5#1_13| 2147483647) (not (= |v_ULTIMATE.start_create_#t~nondet5#1_13| 0)))) (exists ((|v_#valid_73| (Array Int Int))) (and (= (select |v_#valid_73| |ULTIMATE.start_create_#t~ret6#1.base|) 0) (= (store |v_#valid_73| |ULTIMATE.start_create_#t~ret6#1.base| 1) |#valid|))) (exists ((|v_#memory_int_BEFORE_CALL_16| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_11| (Array Int Int)) (|v_old(#length)_AFTER_CALL_11| (Array Int Int)) (|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int))) (|v_#memory_int_49| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (and (= (store |v_#memory_int_49| |ULTIMATE.start_create_~now~0#1.base| (store (select |v_#memory_int_49| |ULTIMATE.start_create_~now~0#1.base|) 0 (select (select |v_#memory_int_BEFORE_CALL_16| |ULTIMATE.start_create_~now~0#1.base|) 0))) |v_#memory_int_BEFORE_CALL_16|) (or (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_56|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (exists ((|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_54| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_54| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_9|)) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_56| (store |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_int_48| (Array Int (Array Int Int)))) (= (store |v_#memory_int_48| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_48| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_49| |ULTIMATE.start_create_~sll~0#1.base|) 8))) |v_#memory_int_49|)) (exists ((|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| (store |v_#memory_$Pointer$.base_54| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_54| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_9| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_#valid_73| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_11| (store |v_#valid_73| |ULTIMATE.start_create_~sll~0#1.base| 1)) (= (select |v_#valid_73| |ULTIMATE.start_create_~sll~0#1.base|) 0))) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#length_59| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_11| (store |v_#length_59| |ULTIMATE.start_create_~sll~0#1.base| 16))) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_9| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_9| (store |v_#memory_int_47| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_main_~data~0#1.base|) 0)))) (<= (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_9| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648))))) (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| (store |v_#memory_$Pointer$.offset_54| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_54| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_10| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (not (= |ULTIMATE.start_create_~sll~0#1.base| 0)) (exists ((|v_#memory_int_47| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_10| (Array Int (Array Int Int)))) (and (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)) (<= (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (= |v_old(#memory_int)_AFTER_CALL_10| (store |v_#memory_int_47| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_47| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_10| |ULTIMATE.start_main_~data~0#1.base|) 0)))))) (exists ((|v_#memory_$Pointer$.base_55| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_55| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |v_#memory_$Pointer$.base_56|)) (= |ULTIMATE.start_create_#in~data#1.base| |ULTIMATE.start_create_~data#1.base|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_create_#in~data#1.base|) (<= (+ |ULTIMATE.start_create_~sll~0#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| (store |v_#memory_$Pointer$.base_54| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_54| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_10| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.offset_55| (Array Int (Array Int Int)))) (= |v_#memory_$Pointer$.offset_56| (store |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_55| |ULTIMATE.start_create_~sll~0#1.base|) 8 0)))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_int_48| (Array Int (Array Int Int)))) (= (store |v_#memory_int_48| |ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_48| |ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |v_#memory_int_49| |ULTIMATE.start_create_~sll~0#1.base|) 8))) |v_#memory_int_49|)) (exists ((|v_#valid_73| (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_11| (store |v_#valid_73| |ULTIMATE.start_create_~sll~0#1.base| 1)) (= (select |v_#valid_73| |ULTIMATE.start_create_~sll~0#1.base|) 0))) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#length_59| (Array Int Int))) (= |v_old(#length)_AFTER_CALL_11| (store |v_#length_59| |ULTIMATE.start_create_~sll~0#1.base| 16))))))) (<= (+ |ULTIMATE.start_create_#t~ret6#1.base| 1) |#StackHeapBarrier|) (exists ((|v_#memory_int_48| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_48| |ULTIMATE.start_create_#t~ret6#1.base| (store (select |v_#memory_int_48| |ULTIMATE.start_create_#t~ret6#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_create_#t~ret6#1.base|) 8))))) (exists ((|v_#length_59| (Array Int Int))) (= (store |v_#length_59| |ULTIMATE.start_create_#t~ret6#1.base| 16) |#length|)))))' at error location [2023-12-02 17:34:33,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:34:33,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:34:33,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-02 17:34:33,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59637823] [2023-12-02 17:34:33,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:34:33,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 17:34:33,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:34:33,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 17:34:33,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=745, Unknown=8, NotChecked=56, Total=930 [2023-12-02 17:34:33,145 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 17:34:33,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:33,542 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2023-12-02 17:34:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:34:33,543 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2023-12-02 17:34:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:33,544 INFO L225 Difference]: With dead ends: 47 [2023-12-02 17:34:33,544 INFO L226 Difference]: Without dead ends: 47 [2023-12-02 17:34:33,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=139, Invalid=849, Unknown=8, NotChecked=60, Total=1056 [2023-12-02 17:34:33,545 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:33,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 178 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 311 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2023-12-02 17:34:33,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-02 17:34:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2023-12-02 17:34:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:34:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2023-12-02 17:34:33,550 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 15 [2023-12-02 17:34:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:33,550 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2023-12-02 17:34:33,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 17:34:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2023-12-02 17:34:33,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:34:33,551 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:33,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:33,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 17:34:33,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:34:33,752 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:34:33,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:33,753 INFO L85 PathProgramCache]: Analyzing trace with hash -138682353, now seen corresponding path program 1 times [2023-12-02 17:34:33,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:33,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014727692] [2023-12-02 17:34:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:33,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:33,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:33,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014727692] [2023-12-02 17:34:33,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014727692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:34:33,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:34:33,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 17:34:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973789784] [2023-12-02 17:34:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:34:33,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 17:34:33,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:34:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 17:34:33,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-02 17:34:33,952 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:34:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:34,115 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-12-02 17:34:34,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 17:34:34,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-12-02 17:34:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:34,116 INFO L225 Difference]: With dead ends: 57 [2023-12-02 17:34:34,116 INFO L226 Difference]: Without dead ends: 57 [2023-12-02 17:34:34,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-02 17:34:34,117 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:34,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 96 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:34:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-02 17:34:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2023-12-02 17:34:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.5) internal successors, (51), 44 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:34:34,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-12-02 17:34:34,123 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 16 [2023-12-02 17:34:34,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:34,123 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-12-02 17:34:34,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:34:34,123 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-12-02 17:34:34,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:34:34,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:34,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:34,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 17:34:34,125 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:34:34,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:34,125 INFO L85 PathProgramCache]: Analyzing trace with hash -138682352, now seen corresponding path program 1 times [2023-12-02 17:34:34,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:34,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241462281] [2023-12-02 17:34:34,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:34,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:34,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:34,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241462281] [2023-12-02 17:34:34,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241462281] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:34:34,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:34:34,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 17:34:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986049801] [2023-12-02 17:34:34,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:34:34,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 17:34:34,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:34:34,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 17:34:34,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:34:34,317 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:34:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:34,498 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2023-12-02 17:34:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:34:34,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-12-02 17:34:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:34,500 INFO L225 Difference]: With dead ends: 64 [2023-12-02 17:34:34,500 INFO L226 Difference]: Without dead ends: 64 [2023-12-02 17:34:34,500 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-12-02 17:34:34,501 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:34,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 89 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:34:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-02 17:34:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2023-12-02 17:34:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 45 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:34:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-12-02 17:34:34,507 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 16 [2023-12-02 17:34:34,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:34,508 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-12-02 17:34:34,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:34:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-12-02 17:34:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 17:34:34,509 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:34,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:34,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 17:34:34,509 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:34:34,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:34,510 INFO L85 PathProgramCache]: Analyzing trace with hash -138681285, now seen corresponding path program 1 times [2023-12-02 17:34:34,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:34,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051965930] [2023-12-02 17:34:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:34,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:34,609 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:34,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051965930] [2023-12-02 17:34:34,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051965930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:34:34,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:34:34,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 17:34:34,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345623607] [2023-12-02 17:34:34,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:34:34,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 17:34:34,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:34:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 17:34:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:34:34,611 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:34:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:34,704 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2023-12-02 17:34:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:34:34,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-12-02 17:34:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:34,706 INFO L225 Difference]: With dead ends: 59 [2023-12-02 17:34:34,706 INFO L226 Difference]: Without dead ends: 59 [2023-12-02 17:34:34,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 17:34:34,707 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 38 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:34,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 143 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:34:34,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-02 17:34:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2023-12-02 17:34:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:34:34,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2023-12-02 17:34:34,712 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 16 [2023-12-02 17:34:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:34,713 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2023-12-02 17:34:34,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:34:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2023-12-02 17:34:34,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 17:34:34,714 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:34,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:34,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 17:34:34,715 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:34:34,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1495392763, now seen corresponding path program 1 times [2023-12-02 17:34:34,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:34,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827539790] [2023-12-02 17:34:34,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:34,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:34:34,821 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:34,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827539790] [2023-12-02 17:34:34,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827539790] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:34:34,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:34:34,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:34:34,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264671305] [2023-12-02 17:34:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:34:34,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:34:34,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:34:34,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:34:34,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:34:34,822 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 17:34:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:34,926 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2023-12-02 17:34:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:34:34,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-02 17:34:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:34,927 INFO L225 Difference]: With dead ends: 50 [2023-12-02 17:34:34,927 INFO L226 Difference]: Without dead ends: 50 [2023-12-02 17:34:34,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:34:34,928 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:34,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:34:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-02 17:34:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-02 17:34:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:34:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2023-12-02 17:34:34,934 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 17 [2023-12-02 17:34:34,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:34,934 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2023-12-02 17:34:34,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 17:34:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2023-12-02 17:34:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 17:34:34,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:34,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:34,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 17:34:34,936 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:34:34,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1495392762, now seen corresponding path program 1 times [2023-12-02 17:34:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:34,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525789017] [2023-12-02 17:34:34,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:34,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:34:35,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:35,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525789017] [2023-12-02 17:34:35,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525789017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:34:35,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:34:35,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 17:34:35,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274703338] [2023-12-02 17:34:35,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:34:35,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 17:34:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:34:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 17:34:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:34:35,154 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 17:34:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:35,273 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-12-02 17:34:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:34:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-02 17:34:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:35,275 INFO L225 Difference]: With dead ends: 49 [2023-12-02 17:34:35,275 INFO L226 Difference]: Without dead ends: 49 [2023-12-02 17:34:35,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:34:35,276 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:35,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 111 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:34:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-02 17:34:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-02 17:34:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 44 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:34:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-12-02 17:34:35,281 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 17 [2023-12-02 17:34:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:35,281 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-12-02 17:34:35,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 17:34:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-12-02 17:34:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 17:34:35,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:35,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:35,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 17:34:35,283 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:34:35,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash -129724947, now seen corresponding path program 1 times [2023-12-02 17:34:35,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:35,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596006386] [2023-12-02 17:34:35,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:35,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:35,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:35,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596006386] [2023-12-02 17:34:35,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596006386] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:34:35,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:34:35,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 17:34:35,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672901527] [2023-12-02 17:34:35,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:34:35,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 17:34:35,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:34:35,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 17:34:35,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:34:35,412 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:34:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:35,532 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2023-12-02 17:34:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:34:35,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-12-02 17:34:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:35,533 INFO L225 Difference]: With dead ends: 55 [2023-12-02 17:34:35,533 INFO L226 Difference]: Without dead ends: 55 [2023-12-02 17:34:35,533 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-12-02 17:34:35,534 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:35,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 103 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:34:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-02 17:34:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2023-12-02 17:34:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.358974358974359) internal successors, (53), 47 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:34:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-12-02 17:34:35,537 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 18 [2023-12-02 17:34:35,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:35,537 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-12-02 17:34:35,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 17:34:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-12-02 17:34:35,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:34:35,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:35,539 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:35,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 17:34:35,540 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:34:35,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 834773278, now seen corresponding path program 1 times [2023-12-02 17:34:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:35,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408304064] [2023-12-02 17:34:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:35,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408304064] [2023-12-02 17:34:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408304064] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:34:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560326169] [2023-12-02 17:34:35,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:35,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:34:35,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:34:35,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:34:35,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 17:34:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:36,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 17:34:36,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:34:36,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 17:34:36,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 17:34:36,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:34:36,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 17:34:36,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:34:36,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 17:34:36,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:34:36,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2023-12-02 17:34:36,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:34:36,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2023-12-02 17:34:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:36,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:34:36,808 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 39 treesize of output 37 [2023-12-02 17:34:36,813 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 37 treesize of output 35 [2023-12-02 17:34:36,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 107 [2023-12-02 17:34:36,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2023-12-02 17:34:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:34:36,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560326169] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:34:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [580888319] [2023-12-02 17:34:36,849 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-12-02 17:34:36,849 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:34:36,850 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:34:36,850 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:34:36,850 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:34:38,512 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 66 for LOIs [2023-12-02 17:34:38,533 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:35:44,691 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2033#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~l~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_create_#res#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_destroy_~l#1.base|) 1)) (= |ULTIMATE.start_destroy_#in~l#1.offset| 0))' at error location [2023-12-02 17:35:44,691 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:35:44,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:35:44,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2023-12-02 17:35:44,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226031768] [2023-12-02 17:35:44,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:35:44,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 17:35:44,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:35:44,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 17:35:44,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1246, Unknown=20, NotChecked=0, Total=1406 [2023-12-02 17:35:44,693 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 17:35:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:35:45,276 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-12-02 17:35:45,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 17:35:45,277 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2023-12-02 17:35:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:35:45,277 INFO L225 Difference]: With dead ends: 57 [2023-12-02 17:35:45,277 INFO L226 Difference]: Without dead ends: 57 [2023-12-02 17:35:45,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 67.0s TimeCoverageRelationStatistics Valid=183, Invalid=1603, Unknown=20, NotChecked=0, Total=1806 [2023-12-02 17:35:45,279 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:35:45,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 268 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:35:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-02 17:35:45,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2023-12-02 17:35:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:35:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-12-02 17:35:45,282 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 21 [2023-12-02 17:35:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:35:45,282 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-12-02 17:35:45,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 17:35:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-12-02 17:35:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 17:35:45,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:35:45,283 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] [2023-12-02 17:35:45,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 17:35:45,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 17:35:45,484 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:35:45,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:35:45,485 INFO L85 PathProgramCache]: Analyzing trace with hash 834774346, now seen corresponding path program 1 times [2023-12-02 17:35:45,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:35:45,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444913968] [2023-12-02 17:35:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:45,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:35:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:35:45,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:35:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444913968] [2023-12-02 17:35:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444913968] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:35:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602124418] [2023-12-02 17:35:45,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:35:45,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:35:45,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:35:45,912 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:35:45,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 17:35:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:35:46,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-02 17:35:46,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:35:46,128 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 17:35:46,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 29 [2023-12-02 17:35:46,207 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2023-12-02 17:35:46,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 37 [2023-12-02 17:35:46,220 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~l#1.base_24| Int) (|ULTIMATE.start_main_~data~0#1.base| Int)) (and (= (select |c_#valid| |ULTIMATE.start_main_~data~0#1.base|) 0) (= (select |c_#valid| |v_ULTIMATE.start_destroy_~l#1.base_24|) 0) (= (store (store |c_#valid| |v_ULTIMATE.start_destroy_~l#1.base_24| 0) |ULTIMATE.start_main_~data~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from true [2023-12-02 17:35:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 17:35:46,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:35:46,301 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_23| Int)) (or (= (store (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_23| 0) |c_ULTIMATE.start_main_~data~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_23|) 0)))) is different from false [2023-12-02 17:35:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602124418] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:35:46,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2087769] [2023-12-02 17:35:46,305 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-12-02 17:35:46,305 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:35:46,305 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:35:46,305 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:35:46,305 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:35:47,755 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 66 for LOIs [2023-12-02 17:35:47,772 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:36:10,831 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2298#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~l~0#1.offset| 0) (not (= |ULTIMATE.start_main_~l~0#1.base| 0)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= (+ |ULTIMATE.start_main_~l~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_#res#1.offset| 0) (exists ((|v_#valid_102| (Array Int Int)) (|v_#memory_int_68| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_#in~data#1.base_10| Int)) (and (= (select |v_#valid_102| |ULTIMATE.start_main_~data~0#1.base|) 1) (or (and (exists ((|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| (store |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_17| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_78| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_78| |ULTIMATE.start_create_#res#1.base|) 8 0)) |v_#memory_$Pointer$.base_79|)) (= |ULTIMATE.start_main_~data~0#1.base| |v_ULTIMATE.start_create_#in~data#1.base_10|) (exists ((|v_#valid_101| (Array Int Int))) (and (= (store |v_#valid_101| |ULTIMATE.start_create_#res#1.base| 1) |v_#valid_102|) (= (select |v_#valid_101| |ULTIMATE.start_create_#res#1.base|) 0))) (exists ((|v_#memory_int_66| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_17| (Array Int (Array Int Int)))) (and (<= (select (select |v_old(#memory_int)_AFTER_CALL_17| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (= |v_old(#memory_int)_AFTER_CALL_17| (store |v_#memory_int_66| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_66| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_17| |ULTIMATE.start_main_~data~0#1.base|) 0)))) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_17| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)))) (exists ((|v_#length_74| (Array Int Int))) (= |#length| (store |v_#length_74| |ULTIMATE.start_create_#res#1.base| 16))) (exists ((|v_#memory_int_67| (Array Int (Array Int Int)))) (= (store |v_#memory_int_67| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_create_#res#1.base|) 8 (select (select |v_#memory_int_68| |ULTIMATE.start_create_#res#1.base|) 8))) |v_#memory_int_68|)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_17| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_77| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_77| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_17| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_17|)) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_create_#res#1.base|) 8 0)) |v_#memory_$Pointer$.offset_79|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_#res#1.base|) 0) |v_ULTIMATE.start_create_#in~data#1.base_10|)) (and (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_78| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_78| |ULTIMATE.start_create_#res#1.base|) 8 0)) |v_#memory_$Pointer$.base_79|)) (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| (store |v_#memory_$Pointer$.base_77| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_77| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_18| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (= |ULTIMATE.start_main_~data~0#1.base| |v_ULTIMATE.start_create_#in~data#1.base_10|) (exists ((|v_#valid_101| (Array Int Int))) (and (= (store |v_#valid_101| |ULTIMATE.start_create_#res#1.base| 1) |v_#valid_102|) (= (select |v_#valid_101| |ULTIMATE.start_create_#res#1.base|) 0))) (exists ((|v_#length_74| (Array Int Int))) (= |#length| (store |v_#length_74| |ULTIMATE.start_create_#res#1.base| 16))) (exists ((|v_#memory_int_66| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_18| (Array Int (Array Int Int)))) (and (<= (select (select |v_old(#memory_int)_AFTER_CALL_18| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_18| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_18| (store |v_#memory_int_66| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_66| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_18| |ULTIMATE.start_main_~data~0#1.base|) 0)))))) (exists ((|v_#memory_int_67| (Array Int (Array Int Int)))) (= (store |v_#memory_int_67| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_67| |ULTIMATE.start_create_#res#1.base|) 8 (select (select |v_#memory_int_68| |ULTIMATE.start_create_#res#1.base|) 8))) |v_#memory_int_68|)) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (not (= |ULTIMATE.start_main_~data~0#1.base| 0)) (exists ((|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_78| |ULTIMATE.start_create_#res#1.base|) 8 0)) |v_#memory_$Pointer$.offset_79|)) (exists ((|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_77| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_18|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_#res#1.base|) 0) |v_ULTIMATE.start_create_#in~data#1.base_10|))) (= |#valid| (store (store |v_#valid_102| |ULTIMATE.start_main_~data~0#1.base| 0) |ULTIMATE.start_main_~l~0#1.base| 0)) (= (store |v_#memory_int_68| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_68| |ULTIMATE.start_create_#res#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 0))) |#memory_int|) (= (select (store |v_#valid_102| |ULTIMATE.start_main_~data~0#1.base| 0) |ULTIMATE.start_main_~l~0#1.base|) 1) (= (store |v_#memory_$Pointer$.base_79| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_79| |ULTIMATE.start_create_#res#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_#res#1.base|) 0))) |#memory_$Pointer$.base|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_79| |ULTIMATE.start_create_#res#1.base|) 0 0))))) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_create_#res#1.base|) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-12-02 17:36:10,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:36:10,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:36:10,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2023-12-02 17:36:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900137191] [2023-12-02 17:36:10,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:10,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 17:36:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:10,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 17:36:10,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1018, Unknown=26, NotChecked=130, Total=1260 [2023-12-02 17:36:10,834 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 18 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 17:36:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:11,399 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2023-12-02 17:36:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 17:36:11,400 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-12-02 17:36:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:11,401 INFO L225 Difference]: With dead ends: 56 [2023-12-02 17:36:11,401 INFO L226 Difference]: Without dead ends: 45 [2023-12-02 17:36:11,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=104, Invalid=1209, Unknown=27, NotChecked=142, Total=1482 [2023-12-02 17:36:11,403 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:11,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 160 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 330 Invalid, 0 Unknown, 49 Unchecked, 0.3s Time] [2023-12-02 17:36:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-02 17:36:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-12-02 17:36:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.40625) internal successors, (45), 40 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:36:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-12-02 17:36:11,406 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 21 [2023-12-02 17:36:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:11,407 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-12-02 17:36:11,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.25) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 17:36:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-12-02 17:36:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 17:36:11,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:11,408 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:11,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 17:36:11,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:11,615 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:36:11,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1118877622, now seen corresponding path program 1 times [2023-12-02 17:36:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:11,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942254648] [2023-12-02 17:36:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:11,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:36:12,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:12,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942254648] [2023-12-02 17:36:12,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942254648] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:12,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694423351] [2023-12-02 17:36:12,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:12,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:12,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:12,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:12,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 17:36:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:12,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 17:36:12,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:12,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:36:12,441 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 17:36:12,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 17:36:12,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 17:36:12,576 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:36:12,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-12-02 17:36:12,591 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 31 treesize of output 13 [2023-12-02 17:36:12,656 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2023-12-02 17:36:12,701 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2023-12-02 17:36:12,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2023-12-02 17:36:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-12-02 17:36:12,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:12,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694423351] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1533137683] [2023-12-02 17:36:12,777 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 17:36:12,777 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:36:12,778 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:36:12,778 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:36:12,778 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:36:20,330 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2023-12-02 17:36:20,337 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:36:43,078 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2523#(not (= (select |#valid| |ULTIMATE.start_create_~now~0#1.base|) 1))' at error location [2023-12-02 17:36:43,078 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:36:43,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:36:43,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2023-12-02 17:36:43,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326185082] [2023-12-02 17:36:43,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:43,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 17:36:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:43,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 17:36:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1068, Unknown=8, NotChecked=66, Total=1260 [2023-12-02 17:36:43,081 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 22 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 18 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-02 17:36:43,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:43,295 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-12-02 17:36:43,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 17:36:43,295 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 18 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2023-12-02 17:36:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:43,296 INFO L225 Difference]: With dead ends: 44 [2023-12-02 17:36:43,296 INFO L226 Difference]: Without dead ends: 44 [2023-12-02 17:36:43,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=128, Invalid=1128, Unknown=8, NotChecked=68, Total=1332 [2023-12-02 17:36:43,297 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:43,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 142 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2023-12-02 17:36:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-02 17:36:43,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-12-02 17:36:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.375) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:36:43,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2023-12-02 17:36:43,300 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 25 [2023-12-02 17:36:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:43,300 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2023-12-02 17:36:43,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 18 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-02 17:36:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2023-12-02 17:36:43,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 17:36:43,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:43,301 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:43,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-02 17:36:43,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:43,502 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:36:43,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1118877623, now seen corresponding path program 1 times [2023-12-02 17:36:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:43,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564796430] [2023-12-02 17:36:43,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:36:44,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564796430] [2023-12-02 17:36:44,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564796430] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:44,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235373383] [2023-12-02 17:36:44,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:44,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:44,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:44,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 17:36:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:44,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-02 17:36:44,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:44,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:36:44,625 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-02 17:36:44,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 17:36:44,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 17:36:44,689 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 19 treesize of output 1 [2023-12-02 17:36:44,823 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 17:36:44,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 74 [2023-12-02 17:36:44,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2023-12-02 17:36:44,890 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 50 treesize of output 26 [2023-12-02 17:36:44,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2023-12-02 17:36:44,983 WARN L876 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2023-12-02 17:36:44,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:44,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-02 17:36:45,016 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 17:36:45,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-12-02 17:36:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-12-02 17:36:45,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:45,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235373383] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:45,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1466240227] [2023-12-02 17:36:45,203 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-12-02 17:36:45,203 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:36:45,203 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:36:45,204 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:36:45,204 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:36:52,654 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2023-12-02 17:36:52,660 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:37:18,999 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2734#(or (< (+ |ULTIMATE.start_create_~now~0#1.offset| 8) 0) (< (select |#length| |ULTIMATE.start_create_~now~0#1.base|) (+ |ULTIMATE.start_create_~now~0#1.offset| 16)))' at error location [2023-12-02 17:37:18,999 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:37:18,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:37:18,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-12-02 17:37:18,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738748513] [2023-12-02 17:37:18,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:37:19,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:37:19,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:37:19,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:37:19,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1490, Unknown=22, NotChecked=78, Total=1722 [2023-12-02 17:37:19,001 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 20 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 17:37:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:19,996 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-12-02 17:37:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 17:37:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 20 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 25 [2023-12-02 17:37:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:19,998 INFO L225 Difference]: With dead ends: 41 [2023-12-02 17:37:19,998 INFO L226 Difference]: Without dead ends: 41 [2023-12-02 17:37:19,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=232, Invalid=2197, Unknown=25, NotChecked=96, Total=2550 [2023-12-02 17:37:19,999 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:20,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 239 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 371 Invalid, 0 Unknown, 38 Unchecked, 0.3s Time] [2023-12-02 17:37:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-02 17:37:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2023-12-02 17:37:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 32 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 17:37:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2023-12-02 17:37:20,002 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2023-12-02 17:37:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:20,002 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2023-12-02 17:37:20,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 20 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 17:37:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2023-12-02 17:37:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 17:37:20,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:20,003 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-12-02 17:37:20,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 17:37:20,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-12-02 17:37:20,204 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:37:20,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1288994629, now seen corresponding path program 1 times [2023-12-02 17:37:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:37:20,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147285777] [2023-12-02 17:37:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:37:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:20,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:20,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:37:20,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147285777] [2023-12-02 17:37:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147285777] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:37:20,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187389140] [2023-12-02 17:37:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:20,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:20,471 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:37:20,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 17:37:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:20,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 17:37:20,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:20,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:37:20,672 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:37:20,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 17:37:20,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 17:37:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:20,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:20,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:20,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2023-12-02 17:37:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187389140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:37:20,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [183958000] [2023-12-02 17:37:20,955 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 17:37:20,955 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:37:20,955 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:37:20,956 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:37:20,956 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:37:28,775 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2023-12-02 17:37:28,782 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:38:43,476 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3006#(and (= |ULTIMATE.start_main_~l~0#1.offset| |ULTIMATE.start_create_#res#1.offset|) (= |ULTIMATE.start_destroy_#in~l#1.offset| |ULTIMATE.start_main_~l~0#1.offset|) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_destroy_#in~l#1.base|) (not (= (select |#valid| |ULTIMATE.start_destroy_~l#1.base|) 1)) (= |ULTIMATE.start_destroy_#in~l#1.offset| |ULTIMATE.start_destroy_~l#1.offset|) (or (not (= |ULTIMATE.start_destroy_~l#1.base| 0)) (not (= |ULTIMATE.start_destroy_~l#1.offset| 0))) (exists ((|v_#valid_144| (Array Int Int))) (and (= (store |v_#valid_144| |ULTIMATE.start_main_~data~0#1.base| 0) |#valid|) (or (= (select |v_#valid_144| |ULTIMATE.start_main_~data~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1.base| 0)) (or (exists ((|v_ULTIMATE.start_create_~now~0#1.base_44| Int) (|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_128| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_127| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~0#1.offset_40| Int) (|v_#memory_$Pointer$.offset_125| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_113| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)) (store (select |v_#memory_int_113| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|))) (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|))) (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)))))) (= (store |v_#memory_int_112| |v_ULTIMATE.start_create_~now~0#1.base_44| (store (select |v_#memory_int_112| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|) (select (select |v_#memory_int_113| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)))) |v_#memory_int_113|) (= (store |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_~now~0#1.base_44| (store (select |v_#memory_$Pointer$.base_127| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|) (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)))) |v_#memory_$Pointer$.base_128|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)) (store (select |v_#memory_$Pointer$.offset_126| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|))) (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|))) (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)))))) (= (select |v_#valid_144| |v_ULTIMATE.start_create_~now~0#1.base_44|) 1) (= (select |v_#valid_144| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|))) 1) (<= (+ (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)) 8) (select |#length| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)))) (<= (+ 16 |v_ULTIMATE.start_create_~now~0#1.offset_40|) (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_44|)) (= (store |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_create_~now~0#1.base_44| (store (select |v_#memory_$Pointer$.offset_125| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|) (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)))) |v_#memory_$Pointer$.offset_126|) (<= 0 (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)) (<= 0 (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|))) (= (store |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)) (store (select |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|))) (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|))) (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_create_~now~0#1.base_44|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_40|))))) |#memory_$Pointer$.base|))) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_create_#in~data#1.base_13| Int) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_124| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_122| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_122| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_122| |ULTIMATE.start_create_#res#1.base|) 0 0))) (= |#memory_int| (store |v_#memory_int_109| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_109| |ULTIMATE.start_create_#res#1.base|) 0 (select (select |#memory_int| |ULTIMATE.start_create_#res#1.base|) 0)))) (or (and (exists ((|v_#memory_$Pointer$.base_123| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_123| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_123| |ULTIMATE.start_create_#res#1.base|) 8 0)) |v_#memory_$Pointer$.base_124|)) (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_#length_103| (Array Int Int))) (= |#length| (store |v_#length_103| |ULTIMATE.start_create_#res#1.base| 16))) (exists ((|v_#memory_int_108| (Array Int (Array Int Int)))) (= (store |v_#memory_int_108| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_108| |ULTIMATE.start_create_#res#1.base|) 8 (select (select |v_#memory_int_109| |ULTIMATE.start_create_#res#1.base|) 8))) |v_#memory_int_109|)) (exists ((|v_#valid_143| (Array Int Int))) (and (= |v_#valid_144| (store |v_#valid_143| |ULTIMATE.start_create_#res#1.base| 1)) (= (select |v_#valid_143| |ULTIMATE.start_create_#res#1.base|) 0))) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_120| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| (store |v_#memory_$Pointer$.offset_120| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_120| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_39| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_#res#1.base|) 0) |v_ULTIMATE.start_create_#in~data#1.base_13|) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_39| (Array Int (Array Int Int)))) (and (= |v_old(#memory_int)_AFTER_CALL_39| (store |v_#memory_int_107| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_107| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_39| |ULTIMATE.start_main_~data~0#1.base|) 0)))) (<= (select (select |v_old(#memory_int)_AFTER_CALL_39| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_39| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)))) (exists ((|v_#memory_$Pointer$.base_122| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| (store |v_#memory_$Pointer$.base_122| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_122| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_121| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_121| |ULTIMATE.start_create_#res#1.base|) 8 0)) |v_#memory_$Pointer$.offset_122|)) (= |ULTIMATE.start_main_~data~0#1.base| |v_ULTIMATE.start_create_#in~data#1.base_13|)) (and (exists ((|v_#memory_$Pointer$.base_123| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_123| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_123| |ULTIMATE.start_create_#res#1.base|) 8 0)) |v_#memory_$Pointer$.base_124|)) (= 0 (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~data~0#1.base|)) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_120| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| (store |v_#memory_$Pointer$.offset_120| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_120| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_40| |ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_40| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_122| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_122| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_122| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| |ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_40|)) (exists ((|v_#length_103| (Array Int Int))) (= |#length| (store |v_#length_103| |ULTIMATE.start_create_#res#1.base| 16))) (exists ((|v_#memory_int_108| (Array Int (Array Int Int)))) (= (store |v_#memory_int_108| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_int_108| |ULTIMATE.start_create_#res#1.base|) 8 (select (select |v_#memory_int_109| |ULTIMATE.start_create_#res#1.base|) 8))) |v_#memory_int_109|)) (exists ((|v_#valid_143| (Array Int Int))) (and (= |v_#valid_144| (store |v_#valid_143| |ULTIMATE.start_create_#res#1.base| 1)) (= (select |v_#valid_143| |ULTIMATE.start_create_#res#1.base|) 0))) (exists ((|v_#memory_int_107| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_40| (Array Int (Array Int Int)))) (and (<= (select (select |v_old(#memory_int)_AFTER_CALL_40| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483647) (= |v_old(#memory_int)_AFTER_CALL_40| (store |v_#memory_int_107| |ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_107| |ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_int)_AFTER_CALL_40| |ULTIMATE.start_main_~data~0#1.base|) 0)))) (<= 0 (+ (select (select |v_old(#memory_int)_AFTER_CALL_40| |ULTIMATE.start_main_~data~0#1.base|) 0) 2147483648)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_#res#1.base|) 0) |v_ULTIMATE.start_create_#in~data#1.base_13|) (= (select |ULTIMATE.start_main_old_#valid#1| 0) 0) (exists ((|v_#memory_$Pointer$.offset_121| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_121| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.offset_121| |ULTIMATE.start_create_#res#1.base|) 8 0)) |v_#memory_$Pointer$.offset_122|)) (= |ULTIMATE.start_main_~data~0#1.base| |v_ULTIMATE.start_create_#in~data#1.base_13|))) (= (store |v_#memory_$Pointer$.base_124| |ULTIMATE.start_create_#res#1.base| (store (select |v_#memory_$Pointer$.base_124| |ULTIMATE.start_create_#res#1.base|) 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_#res#1.base|) 0))) |#memory_$Pointer$.base|))))))) (= |ULTIMATE.start_destroy_#in~l#1.base| |ULTIMATE.start_destroy_~l#1.base|) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_create_#res#1.base|))' at error location [2023-12-02 17:38:43,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:38:43,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:38:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2023-12-02 17:38:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155233239] [2023-12-02 17:38:43,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:38:43,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:38:43,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:38:43,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:38:43,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=881, Unknown=37, NotChecked=0, Total=992 [2023-12-02 17:38:43,478 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:38:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:38:44,391 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2023-12-02 17:38:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 17:38:44,392 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2023-12-02 17:38:44,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:38:44,392 INFO L225 Difference]: With dead ends: 55 [2023-12-02 17:38:44,393 INFO L226 Difference]: Without dead ends: 55 [2023-12-02 17:38:44,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 75.5s TimeCoverageRelationStatistics Valid=112, Invalid=1408, Unknown=40, NotChecked=0, Total=1560 [2023-12-02 17:38:44,394 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:38:44,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 84 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:38:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-02 17:38:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-12-02 17:38:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.275) internal successors, (51), 44 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:38:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2023-12-02 17:38:44,397 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 26 [2023-12-02 17:38:44,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:38:44,397 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2023-12-02 17:38:44,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:38:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2023-12-02 17:38:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 17:38:44,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:38:44,398 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-12-02 17:38:44,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 17:38:44,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 17:38:44,599 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:38:44,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:38:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1288994628, now seen corresponding path program 1 times [2023-12-02 17:38:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:38:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346813765] [2023-12-02 17:38:44,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:44,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:38:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:38:44,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:38:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346813765] [2023-12-02 17:38:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346813765] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:38:44,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356350042] [2023-12-02 17:38:44,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:38:44,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:38:44,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:38:44,879 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:38:44,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 17:38:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:38:45,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-02 17:38:45,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:38:45,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:38:45,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:38:45,252 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 21 treesize of output 25 [2023-12-02 17:38:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:38:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356350042] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:38:45,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [734403588] [2023-12-02 17:38:45,424 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 17:38:45,424 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:38:45,424 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:38:45,424 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:38:45,425 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:38:53,135 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 294 for LOIs [2023-12-02 17:38:53,617 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:39:14,995 WARN L293 SmtUtils]: Spent 7.56s on a formula simplification. DAG size of input: 337 DAG size of output: 320 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:39:15,062 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_create_~data#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (let ((.cse0 (<= (+ |c_ULTIMATE.start_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse1 (<= 16 (select |c_#length| |c_ULTIMATE.start_create_#t~ret4#1.base|))) (.cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse3 (= |c_ULTIMATE.start_create_#in~data#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse4 (exists ((|v_#memory_$Pointer$.base_143| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_143| |c_ULTIMATE.start_create_#t~ret4#1.base| (store (select |v_#memory_$Pointer$.base_143| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8 0)) |c_#memory_$Pointer$.base|))) (.cse5 (= (select |c_#valid| |c_ULTIMATE.start_create_#t~ret4#1.base|) 1)) (.cse6 (exists ((|v_#memory_int_128| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_128| |c_ULTIMATE.start_create_#t~ret4#1.base| (store (select |v_#memory_int_128| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8 (select (select |c_#memory_int| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8)))))) (.cse7 (<= (+ 1 |c_ULTIMATE.start_main_~data~0#1.base|) |c_#StackHeapBarrier|)) (.cse8 (not (= |c_ULTIMATE.start_create_#t~ret4#1.base| 0))) (.cse9 (exists ((|v_#valid_157| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_157| |c_ULTIMATE.start_create_#t~ret4#1.base| 1)) (= (select |v_#valid_157| |c_ULTIMATE.start_create_#t~ret4#1.base|) 0)))) (.cse10 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~data~0#1.base|) 0)) (.cse11 (not (= 0 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_create_~data#1.base| |c_ULTIMATE.start_create_#in~data#1.base|)) (.cse13 (exists ((|v_#length_115| (Array Int Int))) (= (store |v_#length_115| |c_ULTIMATE.start_create_#t~ret4#1.base| 16) |c_#length|))) (.cse14 (exists ((|v_#memory_$Pointer$.offset_141| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_141| |c_ULTIMATE.start_create_#t~ret4#1.base| (store (select |v_#memory_$Pointer$.offset_141| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8 0)) |c_#memory_$Pointer$.offset|)))) (or (and .cse0 .cse1 .cse2 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_142| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_142| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_142| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_48| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_48|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_#memory_$Pointer$.offset_140| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_48| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_48| (store |v_#memory_$Pointer$.offset_140| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_140| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_48| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse13 .cse14 (exists ((|v_old(#memory_int)_AFTER_CALL_48| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int)))) (let ((.cse15 (select (select |v_old(#memory_int)_AFTER_CALL_48| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (<= 0 (+ .cse15 2147483648)) (<= .cse15 2147483647) (= |v_old(#memory_int)_AFTER_CALL_48| (store |v_#memory_int_127| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_127| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse15))))))) (and .cse0 .cse1 .cse2 (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_#memory_int_127| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_old(#memory_int)_AFTER_CALL_47| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (<= .cse16 2147483647) (= |v_old(#memory_int)_AFTER_CALL_47| (store |v_#memory_int_127| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_127| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse16))) (<= 0 (+ 2147483648 .cse16))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_142| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| (store |v_#memory_$Pointer$.base_142| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_142| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_47| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_#memory_$Pointer$.offset_140| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_47| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_140| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_140| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_47| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_47|)) .cse11 .cse12 .cse13 .cse14))) (= |c_ULTIMATE.start_create_#in~data#1.offset| 0)) is different from true [2023-12-02 17:40:51,105 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3314#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)' at error location [2023-12-02 17:40:51,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:40:51,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:40:51,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-12-02 17:40:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315853133] [2023-12-02 17:40:51,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:40:51,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 17:40:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:40:51,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 17:40:51,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1328, Unknown=29, NotChecked=74, Total=1560 [2023-12-02 17:40:51,107 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 20 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 17:40:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:40:51,455 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2023-12-02 17:40:51,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 17:40:51,456 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 26 [2023-12-02 17:40:51,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:40:51,456 INFO L225 Difference]: With dead ends: 63 [2023-12-02 17:40:51,457 INFO L226 Difference]: Without dead ends: 63 [2023-12-02 17:40:51,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 117.8s TimeCoverageRelationStatistics Valid=148, Invalid=1549, Unknown=29, NotChecked=80, Total=1806 [2023-12-02 17:40:51,458 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:40:51,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 180 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:40:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-02 17:40:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2023-12-02 17:40:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 45 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:40:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-12-02 17:40:51,463 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 26 [2023-12-02 17:40:51,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:40:51,463 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-12-02 17:40:51,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.823529411764706) internal successors, (48), 18 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-12-02 17:40:51,463 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-12-02 17:40:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 17:40:51,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:40:51,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:40:51,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 17:40:51,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-02 17:40:51,665 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:40:51,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:40:51,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1888979954, now seen corresponding path program 1 times [2023-12-02 17:40:51,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:40:51,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720049403] [2023-12-02 17:40:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:40:51,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:40:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:40:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:40:52,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:40:52,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720049403] [2023-12-02 17:40:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720049403] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:40:52,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157457709] [2023-12-02 17:40:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:40:52,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:40:52,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:40:52,675 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:40:52,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 17:40:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:40:52,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-02 17:40:52,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:40:52,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:40:52,908 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 17:40:52,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-12-02 17:40:53,156 INFO L349 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-12-02 17:40:53,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2023-12-02 17:40:53,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:40:53,384 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:40:53,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2023-12-02 17:40:53,581 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-02 17:40:53,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 28 [2023-12-02 17:40:53,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:53,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2023-12-02 17:40:53,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 17:40:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:40:53,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:40:54,030 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1018 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1018) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_ULTIMATE.start_create_~sll~0#1.base|))) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1019 Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| v_ArrVal_1019) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1018) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) 1))) is different from false [2023-12-02 17:40:54,042 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (and (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1019 Int)) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~data~0#1.base| v_ArrVal_1019) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1018) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) 1)) (forall ((v_ArrVal_1018 (Array Int Int))) (not (= |c_ULTIMATE.start_create_~sll~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1018) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))))) is different from false [2023-12-02 17:40:54,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:54,050 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2023-12-02 17:40:54,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:54,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-12-02 17:40:54,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 17:40:54,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:40:54,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-02 17:40:54,082 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:40:54,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-02 17:40:54,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157457709] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:40:54,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [514115452] [2023-12-02 17:40:54,289 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 17:40:54,289 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:40:54,289 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:40:54,289 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:40:54,290 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:41:03,387 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2023-12-02 17:41:03,396 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:42:19,749 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3637#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select |#valid| |ULTIMATE.start_destroy_~l#1.base|) 1)))' at error location [2023-12-02 17:42:19,749 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:42:19,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:42:19,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2023-12-02 17:42:19,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354752566] [2023-12-02 17:42:19,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:42:19,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 17:42:19,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:42:19,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 17:42:19,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3192, Unknown=61, NotChecked=230, Total=3660 [2023-12-02 17:42:19,752 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 33 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 17:42:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:42:20,988 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2023-12-02 17:42:20,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 17:42:20,988 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2023-12-02 17:42:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:42:20,989 INFO L225 Difference]: With dead ends: 56 [2023-12-02 17:42:20,989 INFO L226 Difference]: Without dead ends: 56 [2023-12-02 17:42:20,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 78.4s TimeCoverageRelationStatistics Valid=263, Invalid=4236, Unknown=65, NotChecked=266, Total=4830 [2023-12-02 17:42:20,991 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:42:20,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 145 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:42:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-02 17:42:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2023-12-02 17:42:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 49 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:42:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2023-12-02 17:42:20,993 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 31 [2023-12-02 17:42:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:42:20,993 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2023-12-02 17:42:20,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 17:42:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2023-12-02 17:42:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 17:42:20,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:42:20,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:42:20,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 17:42:21,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 17:42:21,196 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:42:21,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:42:21,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1888979955, now seen corresponding path program 1 times [2023-12-02 17:42:21,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:42:21,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705595074] [2023-12-02 17:42:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:42:21,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:42:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:42:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:42:22,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:42:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705595074] [2023-12-02 17:42:22,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705595074] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:42:22,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378783761] [2023-12-02 17:42:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:42:22,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:42:22,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:42:22,121 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:42:22,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 17:42:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:42:22,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 17:42:22,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:42:22,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:42:22,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:42:22,434 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:42:22,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 17:42:22,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:42:22,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 17:42:22,585 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:42:22,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 17:42:22,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 17:42:22,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:22,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2023-12-02 17:42:22,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:22,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2023-12-02 17:42:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:42:22,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:42:23,059 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1116 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1117) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1116) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))) (forall ((v_ArrVal_1117 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1117) |c_ULTIMATE.start_create_~sll~0#1.base|) 8))))) is different from false [2023-12-02 17:42:23,068 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (and (forall ((v_ArrVal_1117 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1117) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))) (forall ((v_ArrVal_1117 (Array Int Int)) (v_ArrVal_1116 (Array Int Int))) (<= (+ 16 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1117) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1116) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))))) is different from false [2023-12-02 17:42:23,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:23,074 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-12-02 17:42:23,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:23,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-12-02 17:42:23,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:23,095 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2023-12-02 17:42:23,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:42:23,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-12-02 17:42:23,104 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:42:23,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-12-02 17:42:23,108 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:42:23,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-02 17:42:23,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378783761] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:42:23,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [318991000] [2023-12-02 17:42:23,259 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 17:42:23,259 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:42:23,260 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:42:23,260 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:42:23,260 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:42:31,417 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2023-12-02 17:42:31,421 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:42:33,825 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_~sll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|) (= |c_ULTIMATE.start_create_~data#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (= |c_ULTIMATE.start_create_~now~0#1.offset| 0) (= |c_ULTIMATE.start_create_~sll~0#1.offset| 0) (let ((.cse0 (exists ((|v_#memory_$Pointer$.offset_173| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_173| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_173| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 0))))) (.cse1 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse2 (exists ((|v_#valid_190| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_190| |c_ULTIMATE.start_create_~sll~0#1.base| 1)) (= (select |v_#valid_190| |c_ULTIMATE.start_create_~sll~0#1.base|) 0)))) (.cse3 (= |c_ULTIMATE.start_create_#in~data#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse4 (exists ((|v_#memory_int_158| (Array Int (Array Int Int)))) (= (store |v_#memory_int_158| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_158| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |c_#memory_int| |c_ULTIMATE.start_create_~sll~0#1.base|) 8))) |c_#memory_int|))) (.cse5 (<= (+ 1 |c_ULTIMATE.start_main_~data~0#1.base|) |c_#StackHeapBarrier|)) (.cse6 (<= 16 (select |c_#length| |c_ULTIMATE.start_create_~sll~0#1.base|))) (.cse7 (= (select |c_#valid| |c_ULTIMATE.start_create_~sll~0#1.base|) 1)) (.cse9 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~data~0#1.base|) 0)) (.cse10 (exists ((|v_#length_132| (Array Int Int))) (= (store |v_#length_132| |c_ULTIMATE.start_create_~sll~0#1.base| 16) |c_#length|))) (.cse11 (not (= 0 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_create_~data#1.base| |c_ULTIMATE.start_create_#in~data#1.base|)) (.cse13 (<= (+ |c_ULTIMATE.start_create_~sll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse14 (exists ((|v_#memory_$Pointer$.base_177| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_177| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_177| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 0))))) (.cse15 (not (= |c_ULTIMATE.start_create_~sll~0#1.base| 0)))) (or (and .cse0 .cse1 .cse2 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_176| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| (store |v_#memory_$Pointer$.base_176| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_176| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_65| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_int_157| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_65| (Array Int (Array Int Int)))) (let ((.cse8 (select (select |v_old(#memory_int)_AFTER_CALL_65| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (<= .cse8 2147483647) (<= 0 (+ .cse8 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_65| (store |v_#memory_int_157| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_157| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse8)))))) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|v_#memory_$Pointer$.offset_172| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_65| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_65| (store |v_#memory_$Pointer$.offset_172| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_172| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_65| |c_ULTIMATE.start_main_~data~0#1.base|) 0)))))) (and .cse0 .cse1 .cse2 (exists ((|v_#memory_int_157| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_66| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_old(#memory_int)_AFTER_CALL_66| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (<= 0 (+ .cse16 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_66| (store |v_#memory_int_157| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_157| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse16))) (<= .cse16 2147483647)))) .cse3 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_172| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_66| (store |v_#memory_$Pointer$.offset_172| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_172| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_66| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_66| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_176| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_66| (store |v_#memory_$Pointer$.base_176| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_176| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_66| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse14 .cse15))) (= |c_ULTIMATE.start_create_#in~data#1.offset| 0)) is different from true [2023-12-02 17:43:44,439 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3971#(and (or (and (= |ULTIMATE.start_main_~l~0#1.offset| |ULTIMATE.start_create_#res#1.offset|) (= |ULTIMATE.start_destroy_#in~l#1.offset| |ULTIMATE.start_main_~l~0#1.offset|) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_destroy_#in~l#1.base|) (exists ((|v_#valid_191| (Array Int Int))) (and (= (store |v_#valid_191| |ULTIMATE.start_main_~data~0#1.base| 0) |#valid|) (exists ((|v_ULTIMATE.start_create_~now~0#1.offset_57| Int) (|v_#memory_$Pointer$.base_182| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_181| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_177| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_178| (Array Int (Array Int Int))) (|v_#memory_int_162| (Array Int (Array Int Int))) (|v_#memory_int_163| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~0#1.base_61| Int)) (and (= (select |v_#valid_191| |v_ULTIMATE.start_create_~now~0#1.base_61|) 1) (= |#memory_int| (store |v_#memory_int_163| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_int_163| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))))) (= (select |v_#valid_191| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) 1) (<= 0 (select (select |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (= (store |v_#memory_$Pointer$.offset_177| |v_ULTIMATE.start_create_~now~0#1.base_61| (store (select |v_#memory_$Pointer$.offset_177| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|) (select (select |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))) |v_#memory_$Pointer$.offset_178|) (<= (+ 16 |v_ULTIMATE.start_create_~now~0#1.offset_57|) (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_61|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_178| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.offset_178| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))))) (<= 0 (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (= (store |v_#memory_int_162| |v_ULTIMATE.start_create_~now~0#1.base_61| (store (select |v_#memory_int_162| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|) (select (select |v_#memory_int_163| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))) |v_#memory_int_163|) (<= (+ (select (select |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) 8) (select |#length| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))) (= (store |v_#memory_$Pointer$.base_182| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (store (select |v_#memory_$Pointer$.base_182| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|))) (select (select |v_#memory_$Pointer$.offset_178| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|))))) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_181| |v_ULTIMATE.start_create_~now~0#1.base_61| (store (select |v_#memory_$Pointer$.base_181| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|) (select (select |v_#memory_$Pointer$.base_182| |v_ULTIMATE.start_create_~now~0#1.base_61|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_57|)))) |v_#memory_$Pointer$.base_182|))) (or (= (select |v_#valid_191| |ULTIMATE.start_main_~data~0#1.base|) 1) (= |ULTIMATE.start_main_~data~0#1.base| 0)))) (= |ULTIMATE.start_destroy_#in~l#1.offset| |ULTIMATE.start_destroy_~l#1.offset|) (= |ULTIMATE.start_destroy_#in~l#1.base| |ULTIMATE.start_destroy_~l#1.base|) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~l~0#1.base| |ULTIMATE.start_create_#res#1.base|)) (and (exists ((|v_ULTIMATE.start_destroy_~l#1.base_41| Int) (|v_#valid_194| (Array Int Int))) (and (<= (+ |v_ULTIMATE.start_destroy_~l#1.base_41| 1) |#StackHeapBarrier|) (= (store |v_#valid_194| |v_ULTIMATE.start_destroy_~l#1.base_41| 0) |#valid|) (or (= |v_ULTIMATE.start_destroy_~l#1.base_41| 0) (= (select |v_#valid_194| |v_ULTIMATE.start_destroy_~l#1.base_41|) 1)))) (<= 0 (+ 8 |ULTIMATE.start_create_#res#1.offset|)) (<= 0 (+ |ULTIMATE.start_main_~l~0#1.offset| 8)) (<= 0 (+ |ULTIMATE.start_destroy_#in~l#1.offset| 8)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (< (select |#length| |ULTIMATE.start_destroy_~l#1.base|) (+ |ULTIMATE.start_destroy_~l#1.offset| 16)) (< (+ |ULTIMATE.start_destroy_~l#1.offset| 8) 0)) (or (not (= |ULTIMATE.start_destroy_~l#1.base| 0)) (not (= |ULTIMATE.start_destroy_~l#1.offset| 0))))' at error location [2023-12-02 17:43:44,439 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:43:44,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:43:44,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2023-12-02 17:43:44,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44054691] [2023-12-02 17:43:44,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:43:44,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 17:43:44,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:43:44,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 17:43:44,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=3219, Unknown=35, NotChecked=348, Total=3782 [2023-12-02 17:43:44,442 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 31 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 17:43:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:43:45,646 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2023-12-02 17:43:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 17:43:45,646 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2023-12-02 17:43:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:43:45,647 INFO L225 Difference]: With dead ends: 70 [2023-12-02 17:43:45,647 INFO L226 Difference]: Without dead ends: 70 [2023-12-02 17:43:45,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 74.8s TimeCoverageRelationStatistics Valid=278, Invalid=4391, Unknown=35, NotChecked=408, Total=5112 [2023-12-02 17:43:45,649 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 69 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:43:45,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 266 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:43:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-02 17:43:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2023-12-02 17:43:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 50 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:43:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-12-02 17:43:45,652 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 31 [2023-12-02 17:43:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:43:45,652 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-12-02 17:43:45,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 26 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 17:43:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-12-02 17:43:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 17:43:45,652 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:43:45,652 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, 1, 1, 1, 1, 1] [2023-12-02 17:43:45,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-02 17:43:45,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 17:43:45,853 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:43:45,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:43:45,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1888981022, now seen corresponding path program 1 times [2023-12-02 17:43:45,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:43:45,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983237197] [2023-12-02 17:43:45,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:43:45,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:43:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:43:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:43:46,480 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:43:46,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983237197] [2023-12-02 17:43:46,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983237197] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:43:46,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888578494] [2023-12-02 17:43:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:43:46,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:43:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:43:46,482 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:43:46,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 17:43:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:43:46,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-02 17:43:46,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:43:46,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:43:46,763 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:43:46,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 17:43:46,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:43:46,897 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:43:46,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-12-02 17:43:47,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:43:47,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2023-12-02 17:43:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:43:47,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:43:47,266 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1212) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 0))) is different from false [2023-12-02 17:43:47,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:43:47,271 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2023-12-02 17:43:47,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:43:47,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-12-02 17:43:47,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 17:43:47,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888578494] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:43:47,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1746343256] [2023-12-02 17:43:47,397 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2023-12-02 17:43:47,397 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:43:47,397 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:43:47,397 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:43:47,397 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:43:53,965 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 1 for LOIs [2023-12-02 17:43:53,970 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:43:54,800 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_create_~data#1.offset| 0) (let ((.cse0 (exists ((|v_#length_139| (Array Int Int))) (= |c_#length| (store |v_#length_139| |c_ULTIMATE.start_create_#t~ret4#1.base| 16)))) (.cse1 (exists ((|v_#memory_$Pointer$.base_193| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_193| |c_ULTIMATE.start_create_#t~ret4#1.base| (store (select |v_#memory_$Pointer$.base_193| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8 0))))) (.cse2 (<= (+ |c_ULTIMATE.start_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse3 (<= 16 (select |c_#length| |c_ULTIMATE.start_create_#t~ret4#1.base|))) (.cse5 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse6 (= |c_ULTIMATE.start_create_#in~data#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse7 (exists ((|v_#memory_int_172| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_172| |c_ULTIMATE.start_create_#t~ret4#1.base| (store (select |v_#memory_int_172| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8 (select (select |c_#memory_int| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8)))))) (.cse8 (= (select |c_#valid| |c_ULTIMATE.start_create_#t~ret4#1.base|) 1)) (.cse9 (<= (+ 1 |c_ULTIMATE.start_main_~data~0#1.base|) |c_#StackHeapBarrier|)) (.cse10 (not (= |c_ULTIMATE.start_create_#t~ret4#1.base| 0))) (.cse11 (exists ((|v_#memory_$Pointer$.offset_187| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_187| |c_ULTIMATE.start_create_#t~ret4#1.base| (store (select |v_#memory_$Pointer$.offset_187| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8 0))))) (.cse12 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~data~0#1.base|) 0)) (.cse13 (not (= 0 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse14 (= |c_ULTIMATE.start_create_~data#1.base| |c_ULTIMATE.start_create_#in~data#1.base|)) (.cse15 (exists ((|v_#valid_206| (Array Int Int))) (and (= (select |v_#valid_206| |c_ULTIMATE.start_create_#t~ret4#1.base|) 0) (= |c_#valid| (store |v_#valid_206| |c_ULTIMATE.start_create_#t~ret4#1.base| 1)))))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((|v_#memory_int_171| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_73| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_old(#memory_int)_AFTER_CALL_73| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (<= .cse4 2147483647) (= |v_old(#memory_int)_AFTER_CALL_73| (store |v_#memory_int_171| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_171| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse4))) (<= 0 (+ 2147483648 .cse4))))) .cse5 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_192| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (store |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_186| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_186| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_186| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_73| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_73|)) .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_74| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_186| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_74| (store |v_#memory_$Pointer$.offset_186| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_186| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_74| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_192| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_74| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_74|)) .cse8 .cse9 .cse10 .cse11 .cse12 (exists ((|v_#memory_int_171| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_74| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_old(#memory_int)_AFTER_CALL_74| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (= |v_old(#memory_int)_AFTER_CALL_74| (store |v_#memory_int_171| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_171| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse16))) (<= 0 (+ .cse16 2147483648)) (<= .cse16 2147483647)))) .cse13 .cse14 .cse15))) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (= |c_ULTIMATE.start_create_#in~data#1.offset| 0)) is different from true [2023-12-02 17:43:54,812 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_~sll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|) (= |c_ULTIMATE.start_create_~data#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (= |c_ULTIMATE.start_create_~now~0#1.offset| 0) (let ((.cse0 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse1 (exists ((|v_#valid_206| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_206| |c_ULTIMATE.start_create_~sll~0#1.base| 1)) (= (select |v_#valid_206| |c_ULTIMATE.start_create_~sll~0#1.base|) 0)))) (.cse2 (= |c_ULTIMATE.start_create_#in~data#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse3 (exists ((|v_#memory_$Pointer$.offset_187| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_187| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_187| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |c_#memory_$Pointer$.offset|))) (.cse4 (<= (+ 1 |c_ULTIMATE.start_main_~data~0#1.base|) |c_#StackHeapBarrier|)) (.cse5 (exists ((|v_#length_139| (Array Int Int))) (= (store |v_#length_139| |c_ULTIMATE.start_create_~sll~0#1.base| 16) |c_#length|))) (.cse6 (<= 16 (select |c_#length| |c_ULTIMATE.start_create_~sll~0#1.base|))) (.cse7 (= (select |c_#valid| |c_ULTIMATE.start_create_~sll~0#1.base|) 1)) (.cse8 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~data~0#1.base|) 0)) (.cse10 (not (= 0 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse11 (= |c_ULTIMATE.start_create_~data#1.base| |c_ULTIMATE.start_create_#in~data#1.base|)) (.cse12 (exists ((|v_#memory_int_172| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_172| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_172| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |c_#memory_int| |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))))) (.cse13 (<= (+ |c_ULTIMATE.start_create_~sll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse14 (exists ((|v_#memory_$Pointer$.base_193| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_193| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_193| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 0)) |c_#memory_$Pointer$.base|))) (.cse15 (not (= |c_ULTIMATE.start_create_~sll~0#1.base| 0)))) (or (and .cse0 .cse1 .cse2 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_74| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_186| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_74| (store |v_#memory_$Pointer$.offset_186| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_186| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_74| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_#memory_$Pointer$.base_192| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_74| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_74| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_74|)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_#memory_int_171| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_74| (Array Int (Array Int Int)))) (let ((.cse9 (select (select |v_old(#memory_int)_AFTER_CALL_74| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (= |v_old(#memory_int)_AFTER_CALL_74| (store |v_#memory_int_171| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_171| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse9))) (<= 0 (+ .cse9 2147483648)) (<= .cse9 2147483647)))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (exists ((|v_#memory_int_171| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_73| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_old(#memory_int)_AFTER_CALL_73| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (<= .cse16 2147483647) (= |v_old(#memory_int)_AFTER_CALL_73| (store |v_#memory_int_171| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_171| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse16))) (<= 0 (+ 2147483648 .cse16))))) .cse0 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_192| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| (store |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_192| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_73| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_73| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_186| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_186| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_186| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_73| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_73|))))) (= |c_ULTIMATE.start_create_~sll~0#1.offset| 0) (= |c_ULTIMATE.start_create_#in~data#1.offset| 0)) is different from true [2023-12-02 17:44:56,967 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4318#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (or (and (= |ULTIMATE.start_main_~l~0#1.offset| 0) (= |ULTIMATE.start_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~l~0#1.base| 0) (exists ((|v_ULTIMATE.start_create_~now~0#1.base_66| Int) (|v_#memory_$Pointer$.offset_191| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_192| (Array Int (Array Int Int))) (|v_#memory_int_176| (Array Int (Array Int Int))) (|v_#memory_int_177| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_198| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~0#1.offset_62| Int) (|v_#valid_207| (Array Int Int)) (|v_#memory_$Pointer$.base_197| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_198| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)) (store (select |v_#memory_$Pointer$.base_198| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|))) (select (select |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|))) (select (select |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)))))) (<= 0 (select (select |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|))) (= (store |v_#memory_int_176| |v_ULTIMATE.start_create_~now~0#1.base_66| (store (select |v_#memory_int_176| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|) (select (select |v_#memory_int_177| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)))) |v_#memory_int_177|) (= |v_#memory_$Pointer$.base_198| (store |v_#memory_$Pointer$.base_197| |v_ULTIMATE.start_create_~now~0#1.base_66| (store (select |v_#memory_$Pointer$.base_197| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|) (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|))))) (= |#memory_int| (store |v_#memory_int_177| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)) (store (select |v_#memory_int_177| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|))) (select (select |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|))) (select (select |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)))))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_192| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)) (store (select |v_#memory_$Pointer$.offset_192| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|))) (select (select |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|))) (select (select |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)))))) (<= (+ 16 |v_ULTIMATE.start_create_~now~0#1.offset_62|) (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_66|)) (= (select |v_#valid_207| |v_ULTIMATE.start_create_~now~0#1.base_66|) 1) (= (store |v_#valid_207| |ULTIMATE.start_main_~data~0#1.base| 0) |#valid|) (or (= |ULTIMATE.start_main_~data~0#1.base| 0) (= (select |v_#valid_207| |ULTIMATE.start_main_~data~0#1.base|) 1)) (<= (+ (select (select |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)) 8) (select |#length| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)))) (= |v_#memory_$Pointer$.offset_192| (store |v_#memory_$Pointer$.offset_191| |v_ULTIMATE.start_create_~now~0#1.base_66| (store (select |v_#memory_$Pointer$.offset_191| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|) (select (select |v_#memory_$Pointer$.offset_192| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|))))) (<= 0 (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|)) (= (select |v_#valid_207| (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_create_~now~0#1.base_66|) (+ 8 |v_ULTIMATE.start_create_~now~0#1.offset_62|))) 1))) (<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_create_#res#1.base| 0)) (and (exists ((|v_ULTIMATE.start_destroy_~l#1.base_47| Int) (|v_#valid_210| (Array Int Int))) (and (or (= (select |v_#valid_210| |v_ULTIMATE.start_destroy_~l#1.base_47|) 1) (= |v_ULTIMATE.start_destroy_~l#1.base_47| 0)) (<= (+ |v_ULTIMATE.start_destroy_~l#1.base_47| 1) |#StackHeapBarrier|) (= (store |v_#valid_210| |v_ULTIMATE.start_destroy_~l#1.base_47| 0) |#valid|))) (<= 0 (+ 8 |ULTIMATE.start_create_#res#1.offset|)) (<= 0 (+ |ULTIMATE.start_main_~l~0#1.offset| 8)))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-12-02 17:44:56,967 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:44:56,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:44:56,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 31 [2023-12-02 17:44:56,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973833989] [2023-12-02 17:44:56,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:44:56,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-02 17:44:56,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:44:56,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-02 17:44:56,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2895, Unknown=37, NotChecked=330, Total=3422 [2023-12-02 17:44:56,969 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 31 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 26 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 17:44:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:44:58,221 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2023-12-02 17:44:58,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-02 17:44:58,221 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 26 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2023-12-02 17:44:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:44:58,221 INFO L225 Difference]: With dead ends: 70 [2023-12-02 17:44:58,222 INFO L226 Difference]: Without dead ends: 70 [2023-12-02 17:44:58,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 64.7s TimeCoverageRelationStatistics Valid=263, Invalid=4267, Unknown=38, NotChecked=402, Total=4970 [2023-12-02 17:44:58,223 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 17:44:58,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 352 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 17:44:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-02 17:44:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2023-12-02 17:44:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:44:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-12-02 17:44:58,226 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 31 [2023-12-02 17:44:58,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:44:58,226 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-12-02 17:44:58,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 26 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 17:44:58,226 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-12-02 17:44:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 17:44:58,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:44:58,227 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:44:58,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 17:44:58,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:44:58,427 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:44:58,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:44:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1461400304, now seen corresponding path program 1 times [2023-12-02 17:44:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:44:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269442969] [2023-12-02 17:44:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:44:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:44:59,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:44:59,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269442969] [2023-12-02 17:44:59,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269442969] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:44:59,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170442286] [2023-12-02 17:44:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:44:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:44:59,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:44:59,030 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:44:59,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 17:44:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:44:59,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-02 17:44:59,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:44:59,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:44:59,316 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:44:59,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 17:44:59,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 17:44:59,427 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 17:44:59,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-12-02 17:44:59,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:44:59,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2023-12-02 17:44:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:44:59,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:44:59,744 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1304 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem7#1.base| v_ArrVal_1304) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2023-12-02 17:44:59,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:44:59,838 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2023-12-02 17:44:59,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:44:59,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2023-12-02 17:44:59,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-12-02 17:44:59,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170442286] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:44:59,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1123983121] [2023-12-02 17:44:59,950 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2023-12-02 17:44:59,950 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:44:59,950 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:44:59,950 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:44:59,951 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:45:06,058 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 294 for LOIs [2023-12-02 17:45:06,467 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:45:24,230 WARN L293 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 337 DAG size of output: 320 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:45:25,545 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_~sll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|) (= |c_ULTIMATE.start_create_~data#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (= |c_ULTIMATE.start_create_~now~0#1.offset| 0) (let ((.cse0 (exists ((|v_#length_146| (Array Int Int))) (= (store |v_#length_146| |c_ULTIMATE.start_create_~sll~0#1.base| 16) |c_#length|))) (.cse1 (exists ((|v_#memory_$Pointer$.offset_201| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_201| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_201| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 0))))) (.cse2 (exists ((|v_#memory_int_186| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_186| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_186| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |c_#memory_int| |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))))) (.cse3 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse4 (exists ((|v_#memory_$Pointer$.base_209| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_209| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_209| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 0))))) (.cse5 (= |c_ULTIMATE.start_create_#in~data#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse6 (<= (+ 1 |c_ULTIMATE.start_main_~data~0#1.base|) |c_#StackHeapBarrier|)) (.cse7 (<= 16 (select |c_#length| |c_ULTIMATE.start_create_~sll~0#1.base|))) (.cse8 (= (select |c_#valid| |c_ULTIMATE.start_create_~sll~0#1.base|) 1)) (.cse9 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~data~0#1.base|) 0)) (.cse11 (not (= 0 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse12 (exists ((|v_#valid_222| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_222| |c_ULTIMATE.start_create_~sll~0#1.base| 1)) (= (select |v_#valid_222| |c_ULTIMATE.start_create_~sll~0#1.base|) 0)))) (.cse13 (= |c_ULTIMATE.start_create_~data#1.base| |c_ULTIMATE.start_create_#in~data#1.base|)) (.cse14 (<= (+ |c_ULTIMATE.start_create_~sll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse15 (not (= |c_ULTIMATE.start_create_~sll~0#1.base| 0)))) (or (and .cse0 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_200| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_82| (store |v_#memory_$Pointer$.offset_200| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_200| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_82| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_82| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_82| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_82|)) .cse6 .cse7 .cse8 .cse9 (exists ((|v_old(#memory_int)_AFTER_CALL_82| (Array Int (Array Int Int))) (|v_#memory_int_185| (Array Int (Array Int Int)))) (let ((.cse10 (select (select |v_old(#memory_int)_AFTER_CALL_82| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (<= .cse10 2147483647) (= |v_old(#memory_int)_AFTER_CALL_82| (store |v_#memory_int_185| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_185| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse10))) (<= 0 (+ .cse10 2147483648))))) .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_81| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_208| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| (store |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_208| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_81| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) (exists ((|v_old(#memory_int)_AFTER_CALL_81| (Array Int (Array Int Int))) (|v_#memory_int_185| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_old(#memory_int)_AFTER_CALL_81| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (= |v_old(#memory_int)_AFTER_CALL_81| (store |v_#memory_int_185| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_185| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse16))) (<= .cse16 2147483647) (<= 0 (+ .cse16 2147483648))))) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((|v_#memory_$Pointer$.offset_200| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_81| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_81| (store |v_#memory_$Pointer$.offset_200| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_200| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_81| |c_ULTIMATE.start_main_~data~0#1.base|) 0)))))))) (= |c_ULTIMATE.start_create_~sll~0#1.offset| 0) (= |c_ULTIMATE.start_create_#in~data#1.offset| 0)) is different from true [2023-12-02 17:46:37,607 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4681#(and (<= 0 (+ 8 |ULTIMATE.start_create_#res#1.offset|)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= |#StackHeapBarrier| |ULTIMATE.start_destroy_~l#1.base|) (= |ULTIMATE.start_destroy_~l#1.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~l~0#1.offset| 8)) (<= 0 (+ |ULTIMATE.start_destroy_#in~l#1.offset| 8)))' at error location [2023-12-02 17:46:37,607 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 17:46:37,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:46:37,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2023-12-02 17:46:37,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702862621] [2023-12-02 17:46:37,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-02 17:46:37,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 17:46:37,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:46:37,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 17:46:37,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2993, Unknown=42, NotChecked=222, Total=3422 [2023-12-02 17:46:37,609 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 30 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 25 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 17:46:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:46:38,969 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2023-12-02 17:46:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 17:46:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 25 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2023-12-02 17:46:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:46:38,970 INFO L225 Difference]: With dead ends: 68 [2023-12-02 17:46:38,970 INFO L226 Difference]: Without dead ends: 68 [2023-12-02 17:46:38,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 92.9s TimeCoverageRelationStatistics Valid=276, Invalid=4245, Unknown=43, NotChecked=266, Total=4830 [2023-12-02 17:46:38,973 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 62 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:46:38,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 250 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:46:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-02 17:46:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2023-12-02 17:46:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 50 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 17:46:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-12-02 17:46:38,975 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 33 [2023-12-02 17:46:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:46:38,975 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-12-02 17:46:38,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 25 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-02 17:46:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-12-02 17:46:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 17:46:38,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:46:38,976 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:46:38,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 17:46:39,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:46:39,177 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2023-12-02 17:46:39,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:46:39,177 INFO L85 PathProgramCache]: Analyzing trace with hash 691747431, now seen corresponding path program 2 times [2023-12-02 17:46:39,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:46:39,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030723899] [2023-12-02 17:46:39,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:46:39,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:46:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:46:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:46:39,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:46:39,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030723899] [2023-12-02 17:46:39,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030723899] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:46:39,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281329999] [2023-12-02 17:46:39,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:46:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:46:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:46:39,506 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:46:39,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_11cf3ea5-b949-4c03-96f4-f286b0c7a1a5/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 17:46:39,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 17:46:39,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:46:39,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-02 17:46:39,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:46:39,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 17:46:39,717 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:46:39,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-02 17:46:39,792 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 17:46:39,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2023-12-02 17:46:39,820 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 19 treesize of output 1 [2023-12-02 17:46:39,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 17:46:39,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 17:46:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:46:39,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:46:40,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:46:40,175 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 17 treesize of output 21 [2023-12-02 17:46:40,269 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:46:40,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281329999] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:46:40,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [915596397] [2023-12-02 17:46:40,271 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-12-02 17:46:40,271 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 17:46:40,271 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 17:46:40,271 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 17:46:40,271 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 17:46:45,272 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 292 for LOIs [2023-12-02 17:46:45,611 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 17:47:02,665 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_create_~data#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (let ((.cse0 (exists ((|v_#memory_$Pointer$.base_240| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_240| |c_ULTIMATE.start_create_#t~ret4#1.base| (store (select |v_#memory_$Pointer$.base_240| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8 0)) |c_#memory_$Pointer$.base|))) (.cse2 (<= (+ |c_ULTIMATE.start_create_#t~ret4#1.base| 1) |c_#StackHeapBarrier|)) (.cse3 (<= 16 (select |c_#length| |c_ULTIMATE.start_create_#t~ret4#1.base|))) (.cse4 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse5 (exists ((|v_#memory_int_216| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_216| |c_ULTIMATE.start_create_#t~ret4#1.base| (store (select |v_#memory_int_216| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8 (select (select |c_#memory_int| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8)))))) (.cse6 (= |c_ULTIMATE.start_create_#in~data#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse7 (= (select |c_#valid| |c_ULTIMATE.start_create_#t~ret4#1.base|) 1)) (.cse8 (<= (+ 1 |c_ULTIMATE.start_main_~data~0#1.base|) |c_#StackHeapBarrier|)) (.cse9 (not (= |c_ULTIMATE.start_create_#t~ret4#1.base| 0))) (.cse10 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~data~0#1.base|) 0)) (.cse11 (exists ((|v_#length_163| (Array Int Int))) (= (store |v_#length_163| |c_ULTIMATE.start_create_#t~ret4#1.base| 16) |c_#length|))) (.cse12 (not (= 0 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse13 (exists ((|v_#memory_$Pointer$.offset_231| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_231| |c_ULTIMATE.start_create_#t~ret4#1.base| (store (select |v_#memory_$Pointer$.offset_231| |c_ULTIMATE.start_create_#t~ret4#1.base|) 8 0)) |c_#memory_$Pointer$.offset|))) (.cse14 (= |c_ULTIMATE.start_create_~data#1.base| |c_ULTIMATE.start_create_#in~data#1.base|)) (.cse15 (exists ((|v_#valid_250| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_250| |c_ULTIMATE.start_create_#t~ret4#1.base| 1)) (= (select |v_#valid_250| |c_ULTIMATE.start_create_#t~ret4#1.base|) 0))))) (or (and .cse0 (exists ((|v_#memory_int_215| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_93| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_int)_AFTER_CALL_93| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (<= .cse1 2147483647) (<= 0 (+ .cse1 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_93| (store |v_#memory_int_215| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_215| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse1)))))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_#memory_$Pointer$.offset_230| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_93| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_93| (store |v_#memory_$Pointer$.offset_230| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_230| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_93| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse11 .cse12 .cse13 .cse14 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_239| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_239| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_239| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_93|)) .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((|v_#memory_$Pointer$.offset_230| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_92| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_230| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_230| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_92| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_92|)) .cse10 .cse11 .cse12 .cse13 .cse14 (exists ((|v_old(#memory_int)_AFTER_CALL_92| (Array Int (Array Int Int))) (|v_#memory_int_215| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_old(#memory_int)_AFTER_CALL_92| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (= |v_old(#memory_int)_AFTER_CALL_92| (store |v_#memory_int_215| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_215| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse16))) (<= .cse16 2147483647) (<= 0 (+ .cse16 2147483648))))) (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_92| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_239| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_92| (store |v_#memory_$Pointer$.base_239| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_239| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_92| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse15))) (= |c_ULTIMATE.start_create_#in~data#1.offset| 0)) is different from true [2023-12-02 17:47:02,678 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_~sll~0#1.base| |c_ULTIMATE.start_create_~now~0#1.base|) (= |c_ULTIMATE.start_create_~data#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (= |c_ULTIMATE.start_create_~now~0#1.offset| 0) (= |c_ULTIMATE.start_create_~sll~0#1.offset| 0) (= |c_ULTIMATE.start_create_#in~data#1.offset| 0) (let ((.cse1 (exists ((|v_#valid_250| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_250| |c_ULTIMATE.start_create_~sll~0#1.base| 1)) (= (select |v_#valid_250| |c_ULTIMATE.start_create_~sll~0#1.base|) 0)))) (.cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse3 (exists ((|v_#memory_int_216| (Array Int (Array Int Int)))) (= |c_#memory_int| (store |v_#memory_int_216| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_int_216| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 (select (select |c_#memory_int| |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))))) (.cse4 (= |c_ULTIMATE.start_create_#in~data#1.base| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse5 (exists ((|v_#memory_$Pointer$.offset_231| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_231| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.offset_231| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 0))))) (.cse6 (<= (+ 1 |c_ULTIMATE.start_main_~data~0#1.base|) |c_#StackHeapBarrier|)) (.cse7 (<= 16 (select |c_#length| |c_ULTIMATE.start_create_~sll~0#1.base|))) (.cse8 (= (select |c_#valid| |c_ULTIMATE.start_create_~sll~0#1.base|) 1)) (.cse9 (exists ((|v_#length_163| (Array Int Int))) (= |c_#length| (store |v_#length_163| |c_ULTIMATE.start_create_~sll~0#1.base| 16)))) (.cse10 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~data~0#1.base|) 0)) (.cse11 (exists ((|v_#memory_$Pointer$.base_240| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_240| |c_ULTIMATE.start_create_~sll~0#1.base| (store (select |v_#memory_$Pointer$.base_240| |c_ULTIMATE.start_create_~sll~0#1.base|) 8 0))))) (.cse12 (not (= 0 |c_ULTIMATE.start_main_~data~0#1.base|))) (.cse13 (= |c_ULTIMATE.start_create_~data#1.base| |c_ULTIMATE.start_create_#in~data#1.base|)) (.cse14 (<= (+ |c_ULTIMATE.start_create_~sll~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse15 (not (= |c_ULTIMATE.start_create_~sll~0#1.base| 0)))) (or (and (exists ((|v_#memory_int_215| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_93| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |v_old(#memory_int)_AFTER_CALL_93| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (<= .cse0 2147483647) (<= 0 (+ .cse0 2147483648)) (= |v_old(#memory_int)_AFTER_CALL_93| (store |v_#memory_int_215| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_215| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse0)))))) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (exists ((|v_#memory_$Pointer$.offset_230| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_93| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.offset)_AFTER_CALL_93| (store |v_#memory_$Pointer$.offset_230| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_230| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_93| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))) .cse11 .cse12 .cse13 .cse14 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_93| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_239| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.base_239| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_239| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_93| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.base)_AFTER_CALL_93|)) .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (exists ((|v_#memory_$Pointer$.offset_230| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.offset)_AFTER_CALL_92| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_230| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.offset_230| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_92| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) |v_old(#memory_$Pointer$.offset)_AFTER_CALL_92|)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (exists ((|v_old(#memory_int)_AFTER_CALL_92| (Array Int (Array Int Int))) (|v_#memory_int_215| (Array Int (Array Int Int)))) (let ((.cse16 (select (select |v_old(#memory_int)_AFTER_CALL_92| |c_ULTIMATE.start_main_~data~0#1.base|) 0))) (and (= |v_old(#memory_int)_AFTER_CALL_92| (store |v_#memory_int_215| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_int_215| |c_ULTIMATE.start_main_~data~0#1.base|) 0 .cse16))) (<= .cse16 2147483647) (<= 0 (+ .cse16 2147483648))))) .cse15 (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_92| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_239| (Array Int (Array Int Int)))) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_92| (store |v_#memory_$Pointer$.base_239| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |v_#memory_$Pointer$.base_239| |c_ULTIMATE.start_main_~data~0#1.base|) 0 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_92| |c_ULTIMATE.start_main_~data~0#1.base|) 0))))))))) is different from true